Services & Resources / Wolfram Forums / MathGroup Archive
-----

MathGroup Archive 2009

[Date Index] [Thread Index] [Author Index]

Search the Archive

Re: Re: Implementation of Minimize for integer programming

  • To: mathgroup at smc.vnet.net
  • Subject: [mg96137] Re: [mg96123] Re: Implementation of Minimize for integer programming
  • From: DrMajorBob <btreat1 at austin.rr.com>
  • Date: Fri, 6 Feb 2009 04:13:07 -0500 (EST)
  • References: <gmbr4v$ihp$1@smc.vnet.net> <200902050942.EAA10614@smc.vnet.net>
  • Reply-to: drmajorbob at longhorns.com

OTOH hand, you get integers "for free" in network flow problems with  
bipartite graphs (when they have integer sources, sinks, and arc limits).  
Many LPs can be cast in this way,

Bobby

On Thu, 05 Feb 2009 03:42:21 -0600, Roman <rschmied at gmail.com> wrote:

> Niko,
>
> as any book on linear or integer programming will tell you, integer
> programming is NP-hard. As a result, any implementation will be "dead
> slow", including Mathematica and GLPK. As far as I know there's
> nothing you can do unless your problem can be simplified or relaxed to
> a linear program.
>
> Roman.
>
>
> On Feb 4, 11:37 am, Niko <niko.schw... at googlemail.com> wrote:
>> Hello, I'm using Minimize to solve an integer program. It is =85 dead
>> slow. So, this is research - is it slow because of the implementation
>> of Minimize? Is it worth it to feed the instance into GLPK? It took me
>> ages to write a formalization that Mathematica 7 accepted.
>>
>> Best regards,
>>
>> Niko
>
>



-- 
DrMajorBob at longhorns.com


  • Prev by Date: Re: Palettes stay behind other open windows
  • Next by Date: Re: Palettes stay behind other open windows
  • Previous by thread: Re: Implementation of Minimize for integer programming in Mathematica
  • Next by thread: FindFit & NIntegrate