LINEAR PROGRAMMING, Operation Research

SOLVE THE FOLLOWING LP USING SIMPLE METHOD MAXIMIZE Z=3X1+2X2
SUBJECT TO CONSTRAINT
X1+X2<=4
X1-X2<=2
X1,X2>=0
Posted Date: 2/13/2013 2:24:22 AM | 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
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

Rank Methods Spearman s When the variables  under  consideration are  not capable  of quantitative  measurement but can  be arranged  in serial  order( ranks) we find  correla

Two Handed process Chart of Signing a Latter     A multiple  activity  chart  records the related  sequence of activities  of more  than one subject, men  and / or  machine  o


A paper mill products two grade of paper viz., X & Y. Because of raw material restriction, it cannot produce more than 400 tons of grade X paper & 300 tons of grade Y paper in a we

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

Briefly discuss the concept of Reporting Entity in SAC 1 How asset is defined and recognised under the AASB Framework? Silver Developers Ltd is a property development company

Model building is the essence of the operations research approaches?


why does south africa regulate int''l trade