Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.soft-sys.math.mathematica > #7060
| From | 道 厚 <shlwell1988@gmail.com> |
|---|---|
| Newsgroups | comp.soft-sys.math.mathematica |
| Subject | LinearProgramming[] |
| Date | 2011-12-09 11:05 +0000 |
| Organization | Steven M. Christensen and Associates, Inc and MathTensor, Inc. |
| Message-ID | <jbsq2h$3uf$1@smc.vnet.net> (permalink) |
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.
Back to comp.soft-sys.math.mathematica | Previous | Next | Find similar | Unroll thread
LinearProgramming[] 道 厚 <shlwell1988@gmail.com> - 2011-12-09 11:05 +0000
csiph-web