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 Simple method. Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2 X1, X2 = 0

Annotated bibliography   In  this  bibliography each  is followed  by a one sentence or  one  paragraph  description of the content  of the work  cited. For  example Bndypad

solve the LPP using simple method, maximize z= 3x1+2x2 subject to constraints

Medical Industry Payments to Physicians The relationships between physicians and medical related companies in the United States, generally acknowledged to be familiar given th

G. Ambler has € 10000 available for a second hand car, but would like to buy a fast car that costs € 25000. He needs the money for that car quickly, and would like to increase his

MAX: 150 X1 + 250 X2 Subject to: 2 X1 + 5 X2 = 200 - resource 1 3 X1 + 7 X2 = 175 - resource 2 X1, X2 = 0 2. How many units of resource 1 are cons


Solve by simplex method Maximize Z = 5x 1 + 3x 2 Subject to 3x 1 + 5x 2 ≤ 15 5x 1 + 2x 2 ≤ 10 &         x 1 ≥ 0, x 2  ≥ 0 [Ans. Max Z = 235/19

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

Discuss the methodology of operation research