Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]


Groups > comp.soft-sys.math.mathematica > #7084 > unrolled thread

LinearProgramming[]

Started by道 厚 <shlwell1988@gmail.com>
First post2011-12-10 12:27 +0000
Last post2011-12-10 12:27 +0000
Articles 1 — 1 participant

Back to article view | Back to comp.soft-sys.math.mathematica


Contents

  LinearProgramming[] 道 厚 <shlwell1988@gmail.com> - 2011-12-10 12:27 +0000

#7084 — LinearProgramming[]

From道 厚 <shlwell1988@gmail.com>
Date2011-12-10 12:27 +0000
SubjectLinearProgramming[]
Message-ID<jbvj6t$ios$1@smc.vnet.net>
We know all constraints in LinearProgramming[] involve ">=" or "<=".

How can I solve the following problem with LinearProgramming[]:

Assuming x+2y-z>0,x+y-z>=60,y+2z>12,x>0,y>0 and z>1

we want to get the minimum of 2x+3y+4z in the abrove constraints.

Note that there are ">" other than ">=" in the constraints we have
given.

[toc] | [standalone]


Back to top | Article view | comp.soft-sys.math.mathematica


csiph-web