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

MathGroup Archive 2009

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

Search the Archive

Re: Implementation of Minimize for integer programming in Mathematica

  • To: mathgroup at smc.vnet.net
  • Subject: [mg96123] Re: Implementation of Minimize for integer programming in Mathematica
  • From: Roman <rschmied at gmail.com>
  • Date: Thu, 5 Feb 2009 04:42:21 -0500 (EST)
  • References: <gmbr4v$ihp$1@smc.vnet.net>

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



  • Prev by Date: Options for Eigenvalues
  • Next by Date: FindFit & NIntegrate
  • Previous by thread: Re: Options for Eigenvalues
  • Next by thread: Re: Re: Implementation of Minimize for integer programming