Re: Linear Programming
- To: mathgroup at smc.vnet.net
- Subject: [mg52729] Re: [mg52707] Linear Programming
- From: Matthias Gottschalk <gottschalk at gfz-potsdam.de>
- Date: Sat, 11 Dec 2004 05:21:30 -0500 (EST)
- References: <200412100123.UAA18978@smc.vnet.net>
- Sender: owner-wri-mathgroup at wolfram.com
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
- References:
- Linear Programming
- From: Matthias Gottschalk <gottschalk@gfz-potsdam.de>
- Linear Programming