MathGroup Archive 2001

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

Search the Archive

Re: simplex method

  • To: mathgroup at
  • Subject: [mg29144] Re: simplex method
  • From: Jens-Peer Kuska <kuska at>
  • Date: Wed, 30 May 2001 23:28:30 -0400 (EDT)
  • Organization: Universitaet Leipzig
  • References: <9f2gre$88f$>
  • Sender: owner-wri-mathgroup at



"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."


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

  • Prev by Date: Re: OOP in Mathematica
  • Next by Date: Re: possible?: Notebook in "batch mode"
  • Previous by thread: simplex method
  • Next by thread: possible?: Notebook in "batch mode"