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
Maximize Z = 2x - 7y subject -2x + 3y = 3 4x + 5y >= 10 6x + 7y 4x + 8y >= 5


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

Ask question #Minimum 100 words acceptNas food produces to kinds of popular dark chocolate bars. the banana and coffee. the banana bar costs 0.22 to make and sells of 0.35, where a

Maximize p = (3)x + 2y subject to 2x + y 3x + 4y >= 12

RANGE Range  is the difference  between  the highest  and the  lowest  value is  series. This is the simplest  absolute measure  of dispersion. Symbolically  : R= L- S

can u send me some assigment problems

a manufacture wants to ship 8 loads of his product as shown below. The matrix gives the mileage from origin to the destination D.

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 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 in