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

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


Machine  Tabulation This methods  of tabulating information  is generally used in  case of extensive  large scale  surveys. Mechanical sorting and tabulating equipments and su

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


factors affecting tha transportation cost

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

1 strategic implication of product and process decisions 2 process planning and design 3 work measurement

These models are applied to the management ( planning controlling and scheduling ) of large scale projects. PERT/ CPM techniques help in identifying potential trouble spots in