simplex method, Operation Research

Solve the following Linear Programming Problem using Simple method.
Maximize Z= 3x1 + 2X2
Subject to the constraints:
X1+ X2 = 4
X1 - X2 = 2
X1, X2 = 0
Posted Date: 2/13/2013 4:02:14 AM | Location : USA







Related Discussions:- simplex method, Assignment Help, Ask Question on simplex method, Get Answer, Expert's Help, simplex method Discussions

Write discussion on simplex method
Your posts are moderated
Related Questions
There is no unique set of problems which can be solved by using operations Research Models r techniques. Several operations Research Models or techniques can be grouped into some b

meaning,significance of operations research in bussiness management?

A paper mill produces two grades of paper viz., X and Y. Because of raw material restrictions, it cannot produce more than 400 tons of grade X paper and 300 tons of grade Y paper i

A paper mill produces two grades of paper viz., X and Y. Because of raw material restrictions, it cannot produce more than 400 tons of grade X paper and 300 tons of grade Y paper i

RANGE Range  is the difference  between  the highest  and the  lowest  value is  series. This is the simplest  absolute measure  of dispersion. Symbolically  : R= L- S

solve the following linear programming problem using simplex method maximize z=3x1+2x2 subject to the constraints: x1+x2 x1+x2 x1,x2>=0

Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2 X 1, X2 = 0

operation research scope

A DRUG MANUFACTURER produces 2 products X1 and X2.X1 needs 2 hours on machine A AND 2 HOURS ON MACHINE B.X2 needs 3 hours on machine A and 1 hour on machine B.If machine A can run

Q3. Solve the following Linear Programming Problem using Simple method. Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2 X1, X2 = 0