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

Ask an Expert

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

Write your message here..

Related Questions

LLP Simple method, Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2... Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2 X1, X2 = 0 on..

Model building, Model building is the essence of the operations research ap... Model building is the essence of the operations research approach? Discuss. question #Minimum 100 words accepted#

MBA, #q.2 Q.2 Six Operators are to be assigned to five jobs with the cost o... #q.2 Q.2 Six Operators are to be assigned to five jobs with the cost of assignment in Rs. given in the matrix below. Determine the optimal assignment. Which operator will have no a

Linear programming simplex method, How to solve linear programming problems... How to solve linear programming problems using simplex method introducing slack variable,surplus variable and artificial variable

Discuss the basic components of any queueing system, Question: (a) Disc... Question: (a) Discuss briefly the four basic components of any queueing system. (b) Explain what you understand by the following models: (i) (M| M | 1 : N | FCFS) (ii

Summary report - report writing presentation, Summary  Report The  r... Summary  Report The  report  format  suggested  above  does  not  contain  any  summary  section. This exclusion  is deliberate. The summary  should  not be  prepared until t

Discuss the term group decision making, a. Determine the following with res... a. Determine the following with respect to decision making approaches: (i) Group decision making (ii) Directive, analytic, conceptual and behavioral decision making styles (8

MODI method, explain the procedure of MODI method of finding solution throu... explain the procedure of MODI method of finding solution through optimaly test.

Linear programming, mile-high microbrewery makes a light beer and a dark be... mile-high microbrewery makes a light beer and a dark beer. mile-high has a limited supply of barley, limited bottling capacity, and a limited market for light beer. profits are $0.

LPP, . A paper mill produces two grades of paper viz., X and Y. Because of ... . 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