Scribd
Upload
6 views29 pages

Presentation 5

The document describes solving a linear programming problem using the graphical method. It presents an example with two products and two machines with constraints on machine hours. By plotting the constraint lines and finding the corner points, the optimal solution that maximizes contribution is determined.

Uploaded by

Aiman Bibi
Copyright
© © All Rights Reserved
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
6 views29 pages

Presentation 5

The document describes solving a linear programming problem using the graphical method. It presents an example with two products and two machines with constraints on machine hours. By plotting the constraint lines and finding the corner points, the optimal solution that maximizes contribution is determined.

Uploaded by

Aiman Bibi
Copyright
© © All Rights Reserved
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/ 29

Graphical Method

LP
P
Method to Solve Linear Programming
Problems
The linear programming problem can be solved
using different methods. Here, we will discuss the
most important techniques like graphical, simplex
and Big M method etc.
Graphical Method

The graphical method is used to optimize the two-


variable linear programming. If the problem has
two decision variables.
A graphical method is the best method to find the
optimal solution.
Steps

 In this method, Construct a graph and plot the constraint


lines.
 Determine the valid side of each constraint line
 Identify the feasible solution region
 Find the corner points
 Evaluate the objective function at corner points to get the
required maximum/minimum value of the objective
function at the optimum point.
Types of Solution

Unique solution
Two solution/ Infinite many Solution
No Solution
Unbounded region with unbounded Solution
Unbounded Region with bounded solution
Two products, namely P1 and P2 are being manufactured.
Each product has to be processed through two machines M1
and M2. One unit of product P1 consumes 4 hours of time on
M1 and 2 hours of time on M2. Similarly, one unit of P2
consumes 2 hours of time on M1 and 4 hours of time on M2.
60 hours of time is available on M1 and 48 hours on M2. The
per unit contribution margin of P1 is 8 and of P2 is 6.
Determine the number of units of P1 and P2 to be
manufactured so as to maximize total contribution.
Products M1 M2 Contribution
Margin
P1 4hrs 2hrs Rs.8
P2 2hrs 4hrs Rs.6
Total Machine 60hrs 48hrs
hours
𝑻𝒉𝒆 𝒂𝒃𝒐𝒗𝒆 𝒑𝒓𝒐𝒃𝒍𝒆𝒎 𝒄𝒂𝒏 𝒃𝒆 𝒇𝒐𝒓𝒎𝒖𝒍𝒂𝒕𝒆𝒅
𝒂𝒔:
𝑴𝒂𝒙𝒊𝒎𝒊𝒔𝒆 𝒛 = 𝟖𝒙𝟏 + 𝟔𝒙𝟐
𝒔𝒖𝒃𝒋𝒆𝒄𝒕 𝒕𝒐 𝒕𝒉𝒆 𝒄𝒐𝒏𝒔𝒕𝒓𝒂𝒊𝒏𝒕𝒔:
𝟒𝒙𝟏 + 𝟐𝒙𝟐 ≤ 𝟔𝟎
𝟐𝒙𝟏 + 𝟒𝒙𝟐 ≤ 𝟒𝟖
𝒙𝟏 ≥ 𝟎
𝒙𝟐 ≥ 𝟎
𝑷𝒍𝒐𝒕𝒕𝒊𝒏𝒈 𝒕𝒉𝒆 𝒕𝒘𝒐 𝒄𝒐𝒏𝒔𝒕𝒓𝒂𝒊𝒏𝒕𝒔, 𝒕𝒓𝒆𝒂𝒕𝒊𝒏𝒈
𝒕𝒉𝒆𝒎 𝒂𝒔 𝒔𝒕𝒓𝒊𝒄𝒕 𝒆𝒒𝒖𝒂𝒍𝒊𝒕𝒊𝒆𝒔:
𝟒𝒙𝟏 + 𝟐𝒙𝟐 ≤ 𝟔𝟎
𝒐𝒓 𝟒𝒙𝟏 + 𝟐𝒙𝟐 = 𝟔𝟎
𝟐𝒙𝟏 + 𝟒𝒙𝟐 ≤ 𝟒𝟖
𝒐𝒓 𝟐𝒙𝟏 + 𝟒𝒙𝟐 = 𝟒𝟖
𝑰𝒏 𝒆𝒒𝒖𝒂𝒕𝒊𝒐𝒏 (𝒊),
𝒍𝒆𝒕 𝒙𝟏 =𝟎
𝟒 × 𝟎 + 𝟐𝒙𝟐 = 𝟔𝟎
𝒐𝒓 𝟎 + 𝟐𝒙𝟐 = 𝟔𝟎
𝒐𝒓 𝟐𝒙𝟐 = 𝟔𝟎
𝒃𝒚 𝒄𝒓𝒐𝒔𝒔 − 𝒎𝒖𝒍𝒕𝒊𝒑𝒍𝒊𝒄𝒂𝒕𝒊𝒐𝒏:

𝒙𝟐 =
𝒐𝒓 𝒙𝟐 = 𝟑𝟎
The first point on line is (0, 30)
𝑰𝒏 𝒆𝒒𝒖𝒂𝒕𝒊𝒐𝒏 𝒊 , 𝒍𝒆𝒕 𝒙𝟐 = 𝟎
𝟒𝒙𝟏 + 𝟐 × 𝟎 = 𝟔𝟎
𝒐𝒓 𝟒𝒙𝟏 + 𝟎 = 𝟔𝟎
𝒐𝒓 𝟒𝒙𝟏 = 𝟔𝟎
𝒃𝒚 𝒄𝒓𝒐𝒔𝒔 − 𝒎𝒖𝒍𝒕𝒊𝒑𝒍𝒊𝒄𝒂𝒕𝒊𝒐𝒏:
𝒙𝟏 = 𝟔𝟎
𝟒
𝒐𝒓 𝒙𝟏 = 𝟏𝟓
∴ 𝒕𝒉𝒆 𝒔𝒆𝒄𝒐𝒏𝒅 𝒑𝒐𝒊𝒏𝒕 𝒐𝒏 𝒍𝒊𝒏𝒆 (i) is (15,0)
𝑰𝒏 𝒆𝒒𝒖𝒂𝒕𝒊𝒐𝒏 𝒊𝒊 , 𝒍𝒆𝒕 𝒙𝟏 = 𝟎
𝟐 × 𝟎 + 𝟒𝒙𝟐 = 𝟒𝟖
𝒐𝒓 𝟎 + 𝟒𝒙𝟐 = 𝟒𝟖
𝒐𝒓 𝟒𝒙𝟐 = 𝟒𝟖
𝒃𝒚 𝒄𝒓𝒐𝒔𝒔 − 𝒎𝒖𝒍𝒕𝒊𝒑𝒍𝒊𝒄𝒂𝒕𝒊𝒐𝒏:
𝒙𝟐 = 𝟒𝟖
𝟒
𝒐𝒓 𝒙𝟐 = 𝟏𝟐
∴ 𝒕𝒉𝒆 𝒇𝒊𝒓𝒔𝒕 𝒑𝒐𝒊𝒏𝒕 𝒐𝒏 𝒍𝒊𝒏𝒆 (𝒊𝒊) is (0, 12)
𝑰𝒏 𝒆𝒒𝒖𝒂𝒕𝒊𝒐𝒏 (𝒊𝒊)
𝒍𝒆𝒕 𝒙𝟐= 𝟎
𝟐𝒙𝟏 + 𝟒 × 𝟎 = 𝟒𝟖
𝒐𝒓 𝟐𝒙𝟏 + 𝟎 = 𝟒𝟖
𝒐𝒓 𝟐𝒙𝟏 = 𝟒𝟖
𝒃𝒚 𝒄𝒓𝒐𝒔𝒔 − 𝒎𝒖𝒍𝒕𝒊𝒑𝒍𝒊𝒄𝒂𝒕𝒊𝒐𝒏:
𝒙𝟏 =
𝒐𝒓 𝒙𝟏 = 𝟐𝟒
𝒕𝒉𝒆 𝒔𝒆𝒄𝒐𝒏𝒅 𝒑𝒐𝒊𝒏𝒕 𝒐𝒏 𝒍𝒊𝒏𝒆 (ii) is (24,0)
𝑷𝒍𝒐𝒕𝒕𝒊𝒏𝒈 𝒕𝒉𝒆 𝒕𝒘𝒐 𝒍𝒊𝒏𝒆𝒔:
35

30

25

20

15

10

0
5 0 10 15 20 25 30 35
35

30

25

20

15

10

0
5 0 10 15 20 25 30 35
35

(𝟎, 𝟑𝟎 )
30

25

20

15

10

0
5 0 10 15 20 25 30 35
35

(𝟎, 𝟑𝟎 )
30

25

20

15

10

0
5 0 10 15 20 25 30 35
35

(𝟎, 𝟑𝟎 )
30

25

20

15

10

0
5 0 10 15 (𝟏𝟓, 𝟎) 20 25 30 35
35

(𝟎, 𝟑𝟎 )
30

25

20

15

10

0
5 0 10 15 (𝟏𝟓, 𝟎) 20 25 30 35
35

(𝟎, 𝟑𝟎 )
30
A

25

20

15

10

0
5 0 10 15 (𝟏𝟓, 𝟎) 20 25 30 35
35

(𝟎, 𝟑𝟎 )
30
A

25

20

15

10

0
5 0 10 B 15 (𝟏𝟓, 20 25 30 35
35

(𝟎, 𝟑𝟎 )
30
A

25

20

15

10

0
5 0 10 B 15 (𝟏𝟓, 20 25 30 35
35

(𝟎, 𝟑𝟎 )
30
A

25

20

15

(𝟎, 𝟏𝟐 )

10

0
5 0 10 B 15 (𝟏𝟓, 20 25 30 35
35

(𝟎, 𝟑𝟎 )
30
A

25

20

15

(𝟎, 𝟏𝟐 )

10

0
5 0 10 B 15 (𝟏𝟓, 20 25 30 35
35

(𝟎, 𝟑𝟎 )
30
A

25

20

15

(𝟎, 𝟏𝟐 )

10

0
5 0 10 B 15 (𝟏𝟓, 20 (𝟐𝟒, 𝟎) 25 30 35
35

(𝟎, 𝟑𝟎 )
30
A

25

20

15

(𝟎, 𝟏𝟐 )
C
10

0
5 0 10 B 15 (𝟏𝟓, 20 (𝟐𝟒, 𝟎) 25 30 35
35

(𝟎, 𝟑𝟎)
30
A

25

20

15

(𝟎, 𝟏𝟐)
C
10

0
5 0 10 B 15 (𝟏𝟓, 20 (𝟐𝟒, 𝟎) 25 30 35
35

(𝟎, 𝟑𝟎)
30
A

25

20

15

(𝟎, 𝟏𝟐)
C
10

0
5 0 10 B 15 (𝟏𝟓, 20 (𝟐𝟒, 𝟎) 25 30 35
Activity
Maximize

Subject to

You might also like