Re: simplex method
- To: mathgroup at smc.vnet.net
- Subject: [mg29144] Re: simplex method
- From: Jens-Peer Kuska <kuska at informatik.uni-leipzig.de>
- Date: Wed, 30 May 2001 23:28:30 -0400 (EDT)
- Organization: Universitaet Leipzig
- References: <9f2gre$88f$1@smc.vnet.net>
- Sender: owner-wri-mathgroup at wolfram.com
Hi,
?ConstrainedMin
"ConstrainedMin[f, {inequalities}, {x, y, ... }] finds the global
minimum of \
f in the domain specified by the inequalities. The variables x, y, ...
are \
all assumed to be non-negative."
Regards
Jens
thida tatiyapaiboon wrote:
>
> Hello
> I have searched about simplex method
> programming. This program help me to solve linear
> programming which has benefit for me.
> I am glad to get your software programme.
> I hope that you will help me .
>
> Thank You
>
> __________________________________________________
> Do You Yahoo!?
> Yahoo! Auctions - buy the things you want at great prices
> http://auctions.yahoo.com/