maths, 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/13/2013 10:36:01 AM | Location :

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

Write discussion on maths
Your posts are moderated
Related Questions
Question : Suppose that you want to invest $10000 in the stock market by buying shares in one of two companies: A and B. Shares in Company A are risky but could yield a 50% ret

Question: (a) A company sells three different products X, Y and Z. The company makes a profit of Rs. 35, Rs. 50 and Rs. 60 per unit on products X, Y and Z respectively. The th

how do you calculate using this method where the least cost appears twice

Disadvantages of Mode a.It is  ill defined. b.It is  indefinite  and it is  some cases impossible  to find a definite  value. c.It is not based on all observation. So  i

how to solve it

Normal 0 false false false EN-IN X-NONE X-NONE

Minimization Example  A farmer is advised to utilize at least 900 kg of mineral A and 1200 kg of mineral B to increase the productivity of crops in his fields.

#questionQuestion. a paper mill produces two grades of paper viz.,xand y.Bacause of raw material restrictions, it cannot produce more than 400 tones of grade x paper and 300 tons

in a rectangular game ,pay of matrix of player A is as follows

Ask question #Minimum 100 words what can engineer planner do in métallurgie accepted#