Scribd
Upload
42 views18 pages

ME 5101 03 LP Graphical Method

This document discusses solving linear programming problems graphically. There are two main methods described: 1) evaluate the objective function at each vertex of the feasible region and choose the minimum, 2) plot lines of the objective function and find the smallest value such that it goes through the feasible region. Examples are provided to demonstrate both methods. Special cases like multiple optimal solutions, unbounded solutions, and infeasible problems are also briefly covered.

Uploaded by

thushari62
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 PPT, PDF, TXT or read online on Scribd
42 views18 pages

ME 5101 03 LP Graphical Method

This document discusses solving linear programming problems graphically. There are two main methods described: 1) evaluate the objective function at each vertex of the feasible region and choose the minimum, 2) plot lines of the objective function and find the smallest value such that it goes through the feasible region. Examples are provided to demonstrate both methods. Special cases like multiple optimal solutions, unbounded solutions, and infeasible problems are also briefly covered.

Uploaded by

thushari62
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 PPT, PDF, TXT or read online on Scribd
You are on page 1/ 18

1

Solving LP Problems
2
3
Graphical Method

4
Minimize f = 180x + 160y
Subject to
6x + 1y  12
3x + 1y  8
4x + 6y  24
x5
y5
x, y  0

5
6
Remark:-
Optimal solution occurs at a vertex
of the feasible region

7
Method 1
Evaluate the objective function at each
vertex
Chose the particular vertex (x, y) which
gives a minimum value for the objective
function

8
9
Method 2
Plot the lines 180x + 160y = p for varying p
values
Find the smallest value of p such that 180x
+ 160y = p goes through a point in the
feasible region

10
Example:
Solve the following LP model graphically:

Maximize f = 5x1 + 4x2


Subject to
6x1 + 4x2  24
x1 + 2x2  6
-x1 + x2  1
x2  2
x1, x2  0

11
Exercise:
Solve the following LP model graphically:
Maximize f = 2x + 3y
Subject to
-2x + y  1
x – 2y  3
x+y 2
x, y  0

12
Special cases in LP

13
More than one optimal solution
Slope of a constraint (satisfied as an
equation in optimal solution) and the
objective function line are the same

14
Example:
Maximize f = 6x + 48y
Subject to
-x + 6y  24
2x – y  7
x + 8y  80
x, y  0

15
Unbounded solution
Decision variables increase / decrease
indefinitely the value of objective
function without violating feasibility
requirements

16
Infeasible solution
Problem has incompatible constraints

17
Example:
Maximize f = 4x1 + 5x2
Subject to
2x1 + 3x2  1
x1 + x2 4
4x1 + 3x2  18
x1, x2   0

18

You might also like