Scribd
Upload
6 views

Session 3- Lesson Material

The document outlines the graphical solution method for linear programming, focusing on maximizing or minimizing objective functions with constraints. It provides examples of linear programming problems, including steps to identify feasible regions and optimal solutions. Additionally, it discusses special cases such as multiple optimum solutions and infeasible solutions.

Uploaded by

pererakevin2500
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
6 views

Session 3- Lesson Material

The document outlines the graphical solution method for linear programming, focusing on maximizing or minimizing objective functions with constraints. It provides examples of linear programming problems, including steps to identify feasible regions and optimal solutions. Additionally, it discusses special cases such as multiple optimum solutions and infeasible solutions.

Uploaded by

pererakevin2500
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 22

COM 3372

Management Science
Shanika Kumarasinghe

Lecturer (Probationary)

Department of Commerce

Faculty of management studies and commerce

University of Sri Jayewardenepura


Session Three:
Linear Programming Solving
Graphical Method
Recommended Reading………………..

• Read Chapter 3 & 4,

• Hamdy A. Taha. (2017). Operations


Research: An Introduction, Tenth
Edition, Pearson Education Limited,
England.
Learning Outcome..
After Studying This Lesson, You Should Be Able To;

✓ Illustrate graphical solution and optimal findings


Solution method of Linear Programme
1) Graphical solution method (GSM)
2) Simplex Solution Method (SM)

Graphical Solution Method (GSM)

This is limited to LP models containing only two decision variables


(Can be used with three variables but only with great difficulty)
Graphical Solution
• Two decision variables in the problem
• The inequalities are assumed to be equations
• The areas outside the feasible area (area covered by all the lines of
constraints in the problem) indicates idle capacity of resource
• The iso-profit line / iso-cost line use to find the optimal solution
• If the iso-profit line / iso-cost line coincides with more than one point
of the feasible polygon, then the problem has second alternate
solution.
Steps
1) Plot constraints
a. Convert mathematical inequalities into equal form
b. Determine the two intersections/ coordinates
c. Plot the function on the graph

2) Identification of the feasible solution region/ area


a. This is the area which satisfied all the constraints
b. It should be in the 1st quadrant of the graph
c. This area can be identified marking the valid solution area of each
constraints
3) Identification of solution points
Three alternative methods

a. Search method
b. Iso- profit or Iso-cost function method
c. Slope comparison method

4) Interpret the solution


Example 1
Maximize Z = 40X + 50X 1 2 (Total Profit)

Subject to;

3X + 3X < 90
1 2 (Raw materials-Kgs)
2X + 4X < 80
1 2 (Labour-Hrs)

X1,x2 > 0 (Non-negativity)


Example 2
Maximize Z = 40X + 35X 1 2 (Total Profit product A&B)

Subject to;

2X + 3X < 60
1 2 (Raw materials-Kgs)
4X + 3X < 96
1 2 (Labour-Hrs)
4X + 3.5 X < 105
1 2 (Packaging hours)

X1,x2 > 0 (Non-negativity)


LP model:
• Example 2.1-1 (The Reddy Mikks Company) Page 45.

Maximize z = 5x1 + 4x2


S.t:
Solution:

Feasible solution
Space: ABCDEF
How to find Optimum Solution? The solution is
x1 = 3 and x2 = 1.5 with z = 5 * 3 + 4 * 1.5
= 21.
This calls for a daily product mix of 3
tons of exterior paint and 1.5 tons of
interior paint. The associated daily profit
is 21,000.
A minimization model Example
Minimize Z = 6X 1 + 3X 2

Subject to,

2X1 + 4X > 2 16
4X1 + 3X > 2 24

X1 + X2 > 0
Example 3
Minimize Z = 40X1 + 24X2 (Total Cost)

Subject to,

20X1 + 50X2 > 4800


80X1 + 50X2 > 7200

X1 + X2 > 0
Exercise
• A firm uses lathes, milling machines and grinding machines to produce two machine parts.
Following table shows the machining time required for each part, the machining time available
on different machines and the profit on each machine part.

Type of machine Machining time required for the machine Maximum time
part (min) available per week
I II (min)

Lathes 12 6 3000
Milling 4 10 2000
Grinding 2 3 900
Profit per unit (Rs) 40 100

Find the number of parts I and II to be manufactured per week to maximize the profit.
Iso-profit or Iso-cost function method
• Iso-profit or cost function line indicates identical profit or cost each point
along that line. This line can be constructed by using the objective function
of the problem. By substituting values for Z of the objective function Iso-
profit function can be constructed starting from the origin of the graph.

• Optimum point

- Maximization problem – when the Iso-profit line touches the extreme right
hand side of the feasible region.

- Minimization problem- When the Iso-cost line touches the first point of
feasible region.
Example 4
Maximize Z = 40X + 50X
1 2 (Total Profit)

Subject to;

3X + 3X < 90
1 2 (Raw materials-Kgs)
2X + 4X < 80
1 2 (Labour-Hrs)

X1,x2 > 0 (Non-negativity)


Example 5
Minimize Z = 6X1 + 3X2
Subject to,

2X1 + 4X2 > 16


4X1 + 3X2 > 24

X1 + X2 > 0
Special cases of linear programming problems

• Multiple optimum solutions


• Infeasible solutions
• Unbound solutions
• Degeneracy problem
www.facebook.com/mgt.sjp.ac.lk https://mgt.sjp.ac.lk/

You might also like