LinearProgramming vs. ConstrainedMin

• To: mathgroup at smc.vnet.net
• Subject: [mg23486] LinearProgramming vs. ConstrainedMin
• From: Jan Krupa <krupa at alpha.sggw.waw.pl>
• Date: Fri, 12 May 2000 22:54:25 -0400 (EDT)
• Sender: owner-wri-mathgroup at wolfram.com

```Do the functions LinearProgramming and ConstrainedMin do
exactly the same job? If not which one is more effective or faster?
In my experience ConstrainedMin is quite faster than
LinearProgramming. Does anyone have similar experience?
How one can try to figure out how the functions work?

I have tried to use Trace (Ma3.0):
In[1]:=Trace[ConstrainedMin[2 x-3 y,{x+y<10,x-y>2,x>1},{x,y}]]
Out[1]=
{{{-(3 y),-3 y,-3 y},2 x-3 y},
ConstrainedMin[2 x-3
y,{x+y<10,x-y>2,x>1},{x,y}],{0,{x\[Rule]6,y\[Rule]4}}}

but
In[2]:=Trace[LinearProgramming[{2,-3},{{-1,-1},{1,-1},{1,0}},{-10,2,1}]]

Out[2]={LinearProgramming[{2,-3},{{-1,-1},{1,-1},{1,0}},{-10,2,1}],{{
System`LPDump`AreWeValid[
LinearProgramming[{2,-3},{{-1,-1},{1,-1},{1,0}},{-10,2,1}],{
2,-3},{{-1,-1},{1,-1},{1,0}},{-10,2,1}]....
... quite many lines of mathematica code

Jan

```

• Prev by Date: Re: real valued solutions?
• Next by Date: Box-Cox transformations
• Previous by thread: Re: Q: make function from Developer` available in package
• Next by thread: Box-Cox transformations