Scribd
Upload
42 views

Optimum Solution 0 10 79.9999999996463

This document presents a linear programming problem to maximize the objective function Z=0.7X1+2.5X2+0.5X3 subject to the constraints that 5X1+20X2+10X3<=1000, X1+3X2+0.5X3<=70, and 0.1X1+0.5X2+0.25X3<=200, with non-negativity constraints on X1, X2, and X3. The optimum solution is found to be X1=0, X2=10, and X3=79.9999999996463.

Uploaded by

Piyush Kakkar
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
42 views

Optimum Solution 0 10 79.9999999996463

This document presents a linear programming problem to maximize the objective function Z=0.7X1+2.5X2+0.5X3 subject to the constraints that 5X1+20X2+10X3<=1000, X1+3X2+0.5X3<=70, and 0.1X1+0.5X2+0.25X3<=200, with non-negativity constraints on X1, X2, and X3. The optimum solution is found to be X1=0, X2=10, and X3=79.9999999996463.

Uploaded by

Piyush Kakkar
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Maximize : Z=0.7X1+2.5X2+0.

5X3
subject to:
5X1+20X2+10X3<=1000
X1+3X2+0.5X3<=70
0.1X1+0.5X2+0.25X3<=200
X1,X2,X3>=0

STUDS PLYWOOD CONCRETE BLOCK


variables X1 X2 X3
objective function maximize 0.7 2.5 0.5
constraint 1 5 20 10
constraint 2 1 3 0.5
constraint 3 0.1 0.5 0.25
constraint 4 0 0 0

optimum solution 0 10 79.9999999996463


LHS sign RHS slack or surplus

65
1000 <= 1000 2.79476353E-09
70 <= 70 6.54694077E-11
25 <= 200 175.0000000001
0 0 0

chap 3 case sun ltd.

You might also like