Scribd
Upload
41 views

LPP Shader

This document describes a linear programming problem to maximize the objective function Z = 9X1 + 10X2 subject to the constraints 4X1 + 3X2 ≤ 240 and 2X1 + X1 ≤ 100, with non-negativity constraints on X1 and X2. The optimal solution is found to be at corner point C, with values of X1 = 30 and X2 = 40, giving an optimal objective value of Z = 670.

Uploaded by

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

LPP Shader

This document describes a linear programming problem to maximize the objective function Z = 9X1 + 10X2 subject to the constraints 4X1 + 3X2 ≤ 240 and 2X1 + X1 ≤ 100, with non-negativity constraints on X1 and X2. The optimal solution is found to be at corner point C, with values of X1 = 30 and X2 = 40, giving an optimal objective value of Z = 670.

Uploaded by

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

Maximize Z = 9 X1 + 10 X2

Subject to: 4 X1 + 3 X2 ≤ 240


2 X1 + X2 ≤ 100
And X1, X2 ≥ 0
Writing the inequalities as equations:
4 X1 + 3 X2 = 240 ----------Eq. 1
2 X1 + X2 = 100 ----------Eq. 2
Eq. 1 Eq. 2
When X1 0 60 0 50
Then X2 80 0 100 0
120

100
2 X1 + X2 = 100

80

60
X2
40
Feasible
Region 4 X1 + 3 X2 = 240
20

0
0 20 40 60 80

X1
B Maximize Z = 9 X1 + 10 X2
Corner point evaluation:
C Corner x1 x2 Z
Feasible
Region
A 0 0 0
D
B 0 80 800
A C 30 40 670
D 50 0 450
Finding optimal point using iso-profit line
120

100 2 X1 + X2 = 100 Optimum

80

60
X2
40
Feasible
Region 4 X1 + 3 X2 = 240
20

0
0 20 40 60 80

X1

You might also like