MathGroup Archive 2004

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

Search the Archive

Re: Linear Programming


Hi,

I found the solution myself:

LinearProgramming[c,m,Transpose[{b,s}]] where s is a vector of zeros 
the same length as vector b.

Remains any ducumentation for DualLinearProgramming.
Any suggestions?


Regards,
Matthias



On 10. Dec,2004, at 2:23, Matthias Gottschalk wrote:

> Hi,
>
> May be somebody can help me out.
>
> I want to solve the following problem with Mathematica 5.1:
>
> minimize     c x
> subject to   A x = b,  l <=  x  <=  h, l  >= 0, h >= 0
>
> LinearProgramming seems to solve only the problem:
>
> minimize     c x
> subject to   A x >= b,  x  >=  l
>
> There seems to be a function DualLinearProgramming for which there
> seems to be no documentation available. Would that function help me?
>
> regards,
> Matthias
>
> -- 
>
> PD Dr. Matthias Gottschalk
> GeoForschungsZentrum
> Projektbereich 4.1
> Telegrafenberg
> 14473 Potsdam
> Germany
>
> tel/fax  +49 (0) 331 288-1418/1402
>
>
>
>
-- 

PD Dr. Matthias Gottschalk
GeoForschungsZentrum
Projektbereich 4.1
Telegrafenberg
14473 Potsdam
Germany

tel/fax  +49 (0) 331 288-1418/1402



  • Prev by Date: Re: a strange line of code
  • Next by Date: Re: a strange line of code
  • Previous by thread: Linear Programming
  • Next by thread: Re: Linear Programming