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

sOLVE THE FOLLOWING D1 D2 D3 SUPPLY s1 2 2 3 10 s2 4 1 2 15 s3 1 3 1 40 Demand 20 15 30

explain the different techniques as operation research

The action phase consists of making recommendations for remedial action to those who first posed the problem and who control the operations directly. These recommendatio

1) Provide an overall description of the business and the competitive environment in which it operates.  You should describe: a) what type of business it  is (e.g. retail, manuf

On the  Basis  of Ratio of Change  Direction   a. Linear Correlation: The  correlation  between  two variables a said  to be liner if  corresponding  to a unit change in th

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

You are required to analyse the case study, as indicated under these headings: 1. Identify FIVE persons, bodies, organisations or groups in the case study. 2. For EACH of the

Maxz=3x1-2x2 St x1 -x2>_0, 3x1-x2 _0

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