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/12/2013 12:44:36 PM | 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

what is the job scope in or?

Limitation  The  report should  also point  out the  main  limitation of the  research reported  therein. This  will be helpful  to the reader who can form  his own opinion

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 assignment

layout of any retailer shop and the reasons for the layout

advantage of quality circle process

#question. 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 grad