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
#questA 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 p


a paper mill prodecs 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 in

write the scope of operation research

metholodolgy of operational research

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

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

maximize z=3x1+2*2 subject to the constraints x1+x2=4 x1-x2=2 x1.x2=0

#what is the similarity and difference between transportation and linear programing models?

Exercise Define the terms used in LPP. Mention the advantages of LPP. What are the assumptions and limitations of LPP? A firm produces three pro