Scribd
Upload
9 views

LP Example

The graphical LP solution procedure has two steps: 1) Determine the feasible solution space by identifying the region satisfying all constraints. 2) Determine the optimum solution by selecting the point within the feasible region that maximizes the objective function.

Uploaded by

Fahad Ali
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
9 views

LP Example

The graphical LP solution procedure has two steps: 1) Determine the feasible solution space by identifying the region satisfying all constraints. 2) Determine the optimum solution by selecting the point within the feasible region that maximizes the objective function.

Uploaded by

Fahad Ali
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Graphical LP solution

The graphical procedure include two steps :


1. Determination of feasible solution space
2. Determination of optimum solution from among all
feasible points in solution space .
Example • Answer :

Max 6x1 + 5x2 • Max z= 6x1 + 5x2


Sub.to
• Sub.to
X 1 + X2 ≤ 5 X1 + X 2 = 5
3x1 + 2x2 ≤ 12 Assume x1 = 0, x2 = 5
If x2 = 0, x1= 5
X1 ,X2 > 0 X1 ( 5,0 )
X2 (0 , 5 )
3x1 + 2x2 = 12
Assume x1 = 0, x2 = 6
If x2 = 0, x1= 4
X1 ( 4,0 )
X2 (0 , 6 )
1. The shaded region has points satisfying all constrain
2. all points in this region satisfy the constrains and are
feasible solution
3. This region is called feasible region

x2

( 0,6) 3x1 + 2x2 =12 Then the answer is :


( 0,5)
( 2,3) Z= 6x1 + 5x2
= 6 x 2 + 5 x 3 = 27
X1 + X2 = 5

( 0,0) ( 4,0) ( 5,0) x1

You might also like