Services & Resources / Wolfram Forums
-----
 /
MathGroup Archive
2001
*January
*February
*March
*April
*May
*June
*July
*August
*September
*October
*November
*December
*Archive Index
*Ask about this page
*Print this page
*Give us feedback
*Sign up for the Wolfram Insider

MathGroup Archive 2001

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

Search the Archive

Re: about ConstrainedMin

  • To: mathgroup at smc.vnet.net
  • Subject: [mg29854] Re: [mg29806] about ConstrainedMin
  • From: "Mark Harder" <harderm at ucs.orst.edu>
  • Date: Fri, 13 Jul 2001 04:19:37 -0400 (EDT)
  • Sender: owner-wri-mathgroup at wolfram.com

Qing,
    For minimization of linear functions with linear constraints, see the
function ConstrainedMin:

In[413]:=
ConstrainedMin[2 x - 3 y, {x + y < 10, x - y > 2, x > 1}, {x, y}]

Out[413]=
{0, {x -> 6, y -> 4}}

In[416]:=
ConstrainedMin[2 x - 3 y, {x + y == 12, x - y > 2, x > 1}, {x, y}]

Out[416]=
{-1, {x -> 7, y -> 5}}

-mark harder


-----Original Message-----
From: qing.cheng at icos.be <qing.cheng at icos.be>
To: mathgroup at smc.vnet.net
Subject: [mg29854] [mg29806] about ConstrainedMin


>
>Dear Mathgroup,
>
>Is there possibilities that I can have the implementation of ConstrainedMin
>or the description of the algorithm. I find it's much more efficient than
>classical simplex method and would like to use it in our application.
>
>Many thanks.
>
>
>QingCheng.
>
>
>My e-mail address is qing.cheng at icos.be
>
>
>



  • Prev by Date: Re: Clearing cache
  • Next by Date: Re: Logic and Truth Tables with Mathematica?
  • Previous by thread: about ConstrainedMin
  • Next by thread: Re: about ConstrainedMin