Services & ResourcesWolfram ForumsMathGroup Archive

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

LinearProgramming[]

• To: mathgroup at smc.vnet.net
• Subject: [mg123512] LinearProgramming[]
• From: é å <shlwell1988 at gmail.com>
• Date: Sat, 10 Dec 2011 07:26:00 -0500 (EST)
• Delivered-to: l-mathgroup@mail-archive0.wolfram.com

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.

• Follow-Ups:
  • Re: LinearProgramming[]
    • From: Virgil Stokes <vs@it.uu.se>