question, 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/20/2013 8:35:36 AM | Location : USA







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

Write discussion on question
Your posts are moderated
Related Questions
Solve the following Linear Programming Problem using Simplex method. Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2 X1, X2 = 0

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

Write a research paper in relation to a Software Design related topic. Diagrams and drawing of attention to key points through highlighting, bulleting etc is encouraged. Questi


Maxz=3x1-2x2 St x1 -x2>_0, 3x1-x2 _0

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

This year Jan Rich, who is ranked number one in women''s singles in tennis, and Marie Wacker, who is ranked number three, will play 4 times. If Marie can beat Jan 3 times, she will

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