Scribd
Upload
38 views12 pages

Graphical Linear Programming Solutions

This document provides an introduction to solving linear programming problems using the graphical method. It discusses the key components of a linear programming problem, including decision variables, objective function, and constraints. It then explains how to graphically represent these components to identify the feasible region and determine the optimal solution, which will coincide with a corner point of the feasible region. The document also discusses some special cases that can occur with multiple optimal solutions, infeasible solutions, or an unbounded solution.

Uploaded by

Swadhin Swadesh
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
38 views12 pages

Graphical Linear Programming Solutions

This document provides an introduction to solving linear programming problems using the graphical method. It discusses the key components of a linear programming problem, including decision variables, objective function, and constraints. It then explains how to graphically represent these components to identify the feasible region and determine the optimal solution, which will coincide with a corner point of the feasible region. The document also discusses some special cases that can occur with multiple optimal solutions, infeasible solutions, or an unbounded solution.

Uploaded by

Swadhin Swadesh
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

Welcome to the course

Operations Research

Solving Linear Programming Problem


Graphical Method

Dr. Ramesh Krishnan


IIM Kozhikode.
Ramesh.Krishnan@iimk.ac.in
Graphical Solution Method
(Corner point solution/Moving profit line technique)
Solution
Decision Variables:
X1 = Number of units of Product A made
X2 = Number of units of Product B made
Parameters/Resources:
Resources R1 & R2
Objective Function:

Constraints:
Graphical Method
https://www.transum.org/Maths/Activity/Graph/Desmos.asp Visuals
Example
𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀 𝑍𝑍 = 3𝑥𝑥1 + 5𝑥𝑥2

Subject to constraints,

𝑥𝑥1 ≤ 4
2𝑥𝑥2 ≤ 12
3𝑥𝑥1 + 2𝑥𝑥2 ≤ 18
𝑥𝑥1 , 𝑥𝑥2 ≥ 0

Convert inequalities into equalities before plotting. Then, identify the region that the constraint is
representing. Determine the feasible region.
Example

𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀 𝑍𝑍 = 3𝑥𝑥1 + 5𝑥𝑥2

Subject to constraints,

𝑥𝑥1 ≤ 4
2𝑥𝑥2 ≤ 12
3𝑥𝑥1 + 2𝑥𝑥2 ≤ 18
𝑥𝑥1 , 𝑥𝑥2 ≥ 0

The optimal solution coincides with one of the corner points of the feasible region

https://www.transum.org/Maths/Activity/Graph/Desmos.asp
Why corner points result in
optimal solution?

Points lying on an iso-objective function line result in producing the same profits.
Moving the objective function line parallelly changes the value of profit.
Special cases
• Multiple solutions
• Infeasible solutions
• Unbounded solutions
• Variables are negative / unrestricted in sign
Special case – Multiple optimal
solutions
𝑀𝑀𝑀𝑀𝑀𝑀 6.3 𝑆𝑆 + 9𝐷𝐷
𝑧𝑧 = 6.3 300 + 9 420 = 5670
𝑧𝑧 = 6.3 500 + 9 252 = 5670
Subject to constraints 𝑧𝑧 = 6.3 420 + 9 336 = 5670

7
𝑆𝑆 + 𝐷𝐷 ≤ 630
10

1 5
𝑆𝑆 + 𝐷𝐷 ≤ 600
2 6
2
𝑆𝑆 + 𝐷𝐷 ≤ 708
3

1 1
𝑆𝑆 + 𝐷𝐷 ≤ 135
10 4

When the objective function line coincides with one of the constraints on the boundary of feasible
region, then there are multiple optimal solutions. Also when the slope of 2 functions same.
Special case – Infeasible solution

𝑴𝑴𝑴𝑴𝑴𝑴 𝟏𝟏𝟏𝟏 𝑺𝑺 + 𝟗𝟗𝟗𝟗


Subject to constraints
7
𝑆𝑆 + 𝐷𝐷 ≤ 630
10

1 5
𝑆𝑆 + 𝐷𝐷 ≤ 600
2 6
2
𝑆𝑆 + 𝐷𝐷 ≤ 708
3
1 1
𝑆𝑆 + 𝐷𝐷 ≤ 135
10 4

𝑆𝑆 ≥ 500

D ≥ 360

If the feasible region doesn’t exist, then the optimization problem doesn’t have any solutions
Special case – Unbounded
solution

When the value of the objective function can be made infinitely large (small) without violating any of the
constraints, then the solution is unbounded

You might also like