linear programming , 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/22/2013 12:05:59 PM | Location : USA







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

Write discussion on linear programming
Your posts are moderated
Related Questions
Dynamic programming may be considered thoutgrowth of mathematical programming and involves the optimization of multistage( sequence of inter related decisions) decision process

Video  Tapes  Video  tapes  are very  information  and attention  grabbing  presentational  supports. They  are  best  for illustrating the  persons  in actions  and presen

#Principles of OR


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

Scenario: You work as a junior employee in the marketing department of a medium-sized Hong Kong organisation. One of your major tasks is your involvement in your organization's

A series of questionnaire for Delphi were mailed to the selected experts who meet the criteria that mention in above. The overall purpose of the Delphi technique was to achieve the

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

can u send me some assigment problems

what are the limitations of north west corner method