Scribd
Upload
32 views3 pages

LPP

The document outlines a linear programming model with decision variables X1 and X2, subject to three constraints and an objective function. The optimal solution is found to be X1 = 2.00 and X2 = 6.00, yielding a maximum objective function value of 30,600. The constraints ensure that the solution adheres to specified limits for resource allocation.

Uploaded by

Urbi Roy Barman
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
32 views3 pages

LPP

The document outlines a linear programming model with decision variables X1 and X2, subject to three constraints and an objective function. The optimal solution is found to be X1 = 2.00 and X2 = 6.00, yielding a maximum objective function value of 30,600. The constraints ensure that the solution adheres to specified limits for resource allocation.

Uploaded by

Urbi Roy Barman
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Decision Variable,

Data LHS RHS Max


X1 X2
Constr1 1 0 4
Constr2 0 2 12
Constr3 3 2 18

c1 c2
obj. fn. Coeff 300 5000 Range of optimality

Model
X1 X2
Decision Variable 2.00 6.00 Optimal Solution

obj. Fn 30,600.00 300X1+5000X2 Optimal obj. fn value

LHS RHS
Constrain1 2 <= 4 X1<=4 B5*$B$16+C5*$C$16
Constrain2 12 <= 12 2X2<=12 B6*$B$16+C6*$C$16
Constrain3 18 <= 18 3x1 + 2x2 <=18 B7*$B$16+C7*$C$17
300X1+5000X2

st
X1<=4
2X2<=12
3x1 + 2x2 <=18
X1, X2≥ 0

B5*$B$16+C5*$C$16
B6*$B$16+C6*$C$16
B7*$B$16+C7*$C$17

You might also like