solved the question, Operation Research

#questionthe 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/24/2013 6:58:05 AM | Location : USA







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

Write discussion on solved the question
Your posts are moderated
Related Questions
Problems based on LPP when feasible region is a line segment or it does not exist. 1.    Maximize z = 2x+3y subject to the constraints X + y ≤ 1 X + y ≥ 3 X,  y ≥ 0

classification on the bases of function or purpose

. 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 pape

Cost The  cost factor  is a very  important  factor in determining  the size of the  sample. The budget for research should be properly  decided. The management may not lik


Determining Degrees of Freedom   One of the prerequisites for using chi square test is that we should calculate the number of degrees of freedom for the contingency table. T

During busy times, 60 potential customers per hour arrive at the booth (assume a Poisson distribution). A booth worker takes 5 minutes, on average, to meet the information needs of

Do it  Everything  about  the presentation is  ready and so  are you. The only  things  left if to face the audience in a confident and positive  manner and leave a mark on

b. 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 pape

#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