Scribd
Upload
5 views10 pages

Graphical Solution To LPP

The document discusses the graphical solution to linear programming problems (LPP), specifically focusing on maximizing or minimizing objective functions subject to various constraints. It includes examples of LPPs, definitions of binding, non-binding, and redundant constraints, as well as concepts of unique and multiple optimal solutions, infeasibility, and unboundedness. Additionally, it provides exercises for solving LPPs graphically.

Uploaded by

Deepanshu Saxena
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
5 views10 pages

Graphical Solution To LPP

The document discusses the graphical solution to linear programming problems (LPP), specifically focusing on maximizing or minimizing objective functions subject to various constraints. It includes examples of LPPs, definitions of binding, non-binding, and redundant constraints, as well as concepts of unique and multiple optimal solutions, infeasibility, and unboundedness. Additionally, it provides exercises for solving LPPs graphically.

Uploaded by

Deepanshu Saxena
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/ 10

21-01-2025

Linear Programming
Problem (LPP) – Graphical
Solution
Session 5

Graphical Solution to the Par, Inc.


Problem
 Maximize 10S + 9D
 Subject to (s.t.)
7
 10 𝑆 + 1𝐷 ≤ 630 Cutting & Dyeing
1 5
 2 𝑆 + 6 𝐷 ≤ 600 Sewing
2
 1𝑆 + 3 𝐷 ≤ 708 Finishing
1 1
 𝑆 + 𝐷 ≤ 135 Inspection and Packaging
10 4
 S, D ≥ 0

1
21-01-2025

Graphical Solution to the Par, Inc.


Problem
 A linear programming
problem involving only two
decision variables can be
solved using a graphical
solution procedure.
 Consider the example of Par,
Inc.

Source: Anderson et al. (2018: 33)

Feasible region defined by the cutting


and dyeing & sewing constraint

Source: Anderson et al. (2018: 35-36)

2
21-01-2025

Feasible region defined by the finishing


& inspection and packaging constraint

Source: Anderson et al. (2018: 36)

Combined constraint graph with the


common feasible region

Source: Anderson et al. (2018: 37)

3
21-01-2025

Finding the optimal solution

 One approach to finding the


optimal solution would be to
evaluate the objective function
for each feasible solution; which is
practically not feasible.
 So, to compute the profit
contribution for each feasible
solution, we select an arbitrary
value for profit contribution and
identify all the feasible solutions
(S, D) that yield the selected
value.
 For example, which feasible
solutions provide a profit
contribution of $1800?
 These solutions are given by the
values of S and D in the feasible
region that will make the
objective function 10S + 9D = Source: Anderson et al. (2018: 38)
1800

Optimal solution

Source: Anderson et al. (2018: 39-40)

4
21-01-2025

Solution to Example 2 (Product mix


decision problem)
 The objective function:
 Maximize Z = 40 𝑥1 + 35 𝑥2
 Constraints
 2 𝑥1 + 3 𝑥2 ≤ 60
 4 𝑥1 + 3 𝑥2 ≤ 96
 𝑥1 , 𝑥2 ≥ 0

Graphical Solution to Example 2

Source: Vohra (2017: 26)

5
21-01-2025

Solution to Example 3 (Fertilizer choice


decision)
 The objective function:
 Minimize Z = 40 𝑥1 + 24 𝑥2
 Constraints
 20 𝑥1 + 50 𝑥2 ≥ 4800
 80 𝑥1 + 50 𝑥2 ≥ 7200
 𝑥1 , 𝑥2 ≥ 0

Graphical Solution to Example 3

Source: Vohra (2017: 28)

6
21-01-2025

Binding, non-binding and redundant


constraints
 A constraint is binding if the left-hand side and right-
hand side of it are equal when the optimal values of the
decision variables are substituted into the constraint.
 If the substitution of the decision variables does not lead
to an equality of the left-hand and right-hand sides of
the constraint, it is said to be non-binding.
 If and when a constraint, when plotted, does not form
part of the boundary marking the feasible region of the
problem, it is said to be redundant.
 The inclusion or exclusion of the redundant constraint does not
affect the optional solution to the problem.

Unique and multiple optimal solutions


 When the linear programming problem has a single optimal
solution, the solution is said to be unique.
 The solution (if it exists) of a linear programing problem shall
always be unique if the slope of the objective function is
different from the slopes of the constraint.
 In case the objective function has a slope, which is the same
as that of a constraint, then multiple optimal solution may
exist.
 Two conditions under which multiple solution exists:
 The objective function is parallel to a constraint that forms an edge
or boundary on the feasible region, and
 The constraint must be a binding constraint

7
21-01-2025

Infeasibility and Unboundedness


 Infeasibility: Sometimes it is possible that the constraints
may be inconsistent so that there is no feasible solution
to the problem. Such a situation is called infeasibility
 Unboundedness: For a maximization type of LPP,
unboundedness occurs when there is no constraint on
the solution so that one or more of the decision variables
can be increased indefinitely without violating any of
the restrictions (constraints)
 While both infeasibility and unboundedness both does
not give an optimal solution, infeasibility means there is
not a single feasible solution while unboundedness
means that there are infinite feasible solutions but none
of them can be termed as optimal

Exercise 1
 Solve graphically the following LPP:
 Maximize Z = 8𝑥1 + 16𝑥2
 Subject to:
 𝑥1 + 𝑥2 ≤ 200
 𝑥2 ≤ 125
 3𝑥1 + 6𝑥2 ≤ 900
 𝑥1 , 𝑥2 ≥ 0

8
21-01-2025

Exercise 2
 Solve graphically the following LPP:
 Minimize Z = 6𝑥1 + 14𝑥2
 Subject to:
 5𝑥1 + 4𝑥2 ≥ 60
 3𝑥1 + 7𝑥2 ≤ 84
 𝑥1 + 2𝑥2 ≥ 18
 𝑥1 , 𝑥2 ≥ 0

Exercise 3
 Solve graphically the following LPP:
 Maximize Z = 20𝑥1 + 30𝑥2
 Subject to:
 2𝑥1 + 𝑥2 ≤ 40
 4𝑥1 − 𝑥2 ≤ 20
 𝑥1 ≥ 30
 𝑥1 , 𝑥2 ≥ 0

9
21-01-2025

Exercise 4

 Solve graphically the following LPP:


 Maximize Z = 10𝑥1 + 20𝑥2
 Subject to:
 2𝑥1 + 4𝑥2 ≥ 16
 𝑥1 + 5𝑥2 ≥ 15
 𝑥1 , 𝑥2 ≥ 0

10

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy