Scribd
Upload
17 views15 pages

Lecture 6

The document discusses linear programming and graphical methods for solving problems with two variables. It defines key terms like feasible and optimal solutions. For problems with two variables, the feasible region can be plotted graphically to locate the optimal solution. Two graphical methods are described: the extreme point solution method and iso-profit line method. Examples are also provided.

Uploaded by

Aman Keshari
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
17 views15 pages

Lecture 6

The document discusses linear programming and graphical methods for solving problems with two variables. It defines key terms like feasible and optimal solutions. For problems with two variables, the feasible region can be plotted graphically to locate the optimal solution. Two graphical methods are described: the extreme point solution method and iso-profit line method. Examples are also provided.

Uploaded by

Aman Keshari
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/ 15

Linear Programming : The Graphical method

Important Definitions
Lecture 6
03/07/2021
Introduction

• An optimal as well as a feasible solution to an LP problem is obtained


by choosing one set of values from several possible values of the
decision variables 𝑥1 , 𝑥2 , … 𝑥𝑛 that satisfies the given constraints
simultaneously and also provides an optimal (maximum or
minimum) value of the given objective function.
• For LP problems that have only two variables, it is possible that the
entire set of feasible solution can be displayed graphically by plotting
linear constraints on a graph paper in order to locate the optimal
solution. The technique used to identify the optimal solution is called
graphical solution method (or approach or technique) for an LP
problem with two variables .

03/07/2021 Pravida Raja SXCA


Introduction (contd…)

• Since most real world problems have more than two decision
variables, such problems cannot be solved graphically. However
graphical approach provides understanding of solving an LP
problem algebraically involving more than two variables.
• In this unit, we discuss the following two graphical solution methods
(or approaches) .
i. Extreme point solution method
ii. Iso-profit (cost) function line method

03/07/2021 Pravida Raja SXCA


Important Definitions
❑Solution : The set of values of the decision variables 𝑥𝑗
(j=1,2,…,n) that satisfy the constraints of a LP problem is said
to constitute the solution to that LP problem .
❑Feasible solution : The set of values of decision variables 𝑥𝑗
(j=1,2,…,n) that satisfy all the constraints and non negativity
conditions of an LP problem simultaneously is set to constitutes a
feasible solution to that LP problem.
❑Infeasible solution: The set of values of decision variables 𝑥𝑗
(j=1,2,…,n) that do not satisfy all the constraints and non
negativity conditions of an LP problem simultaneously is said to
constitute infeasible solution to that LP problem .

03/07/2021 Pravida Raja SXCA


Important Definitions(contd…)
❑Basic solution : For a set of 𝑚 simultaneous equations in
𝑛 variables (𝑛>𝑚) in a LP problem, a solution obtained by setting
𝑛 − 𝑚 variables equal to zero and solving for remaining 𝑚
equations in 𝑚 variables is called a basic solution to the LP
problem .
• The 𝑛 − 𝑚 variables whose value did not appear in basic
solution are called non basic variables and the remaining
𝑚 variables are called basic variables.

03/07/2021 Pravida Raja SXCA


Important Definitions(contd…)
❑Basic feasible solution :A feasible solution to an LP problem which is
also the basic solution is called the basic feasible solution. That is, all
basic variables assume non negative values. Basic feasible solution is
of two types.
a) Degenerate :A basic feasible solution is called degenerate if the
value of at least one basic variable is zero.
b) Non-degenerate : A basic feasible solution is called non
degenerate If value of all 𝑚 basic variables is non zero and positive.

03/07/2021 Pravida Raja SXCA


Important Definitions(contd…)
❑Optimum basic feasible solution : A basic feasible solution that
optimizes (maximizes or minimizes) the objective function value of
the given LP problem is called an optimum basic feasible solution.
• The term optimal solution is also used for optimum solution.
❑Unbounded solution: A solution that can increase or decrease
infinitely the value of objective function of the LP problem is called
and unbounded solution.

03/07/2021 Pravida Raja SXCA


Important Definitions(contd…)
❑Convex set: A set 𝑋 is said to be convex, if for any points 𝑝1 , 𝑝2 in
the set , the line segment joining these points is also in the set.
• The definition implies that if 𝑃1 , 𝑃2 ∈ 𝑋, then every point 𝑋 =
𝛼𝑝1 + 1 − 𝛼 𝑝2 , 0 ≤ 𝛼 ≤ 1 must also be in the set.

03/07/2021 Pravida Raja SXCA


Important Definitions(contd…)
❑Non-convex(concave sets): It is a collection of points such that if
𝑃1 , 𝑃2 are any two points in the collection, the line segment joining
them is not entirely in the collection.
• Here we cannot find a linear combination for 𝑃1 , 𝑃2 ∈ 𝑋, such that
𝑋 = 𝛼𝑝1 + 1 − 𝛼 𝑝2 , 0 ≤ 𝛼 ≤ 1

03/07/2021 Pravida Raja SXCA


Important Definitions(contd…)
❑Vertex (extreme point): An extreme point (vertex) of a convex set
is a point of the set which does not lie on any segment joining two
other points of the set. That is a point 𝑋 of a convex set S is an
extreme point of S, if there does not exists any pair of points 𝑝1 and
𝑝2 such that 𝑋 = 𝛼𝑝1 + 1 − 𝛼 𝑝2 ; 0<𝛼<1.
• In plane, an extreme point is the point of intersection of two
constraint equations.
• Extreme point refers to the corner of the feasible region. The set of
all feasible solutions to a LPP constitutes the feasible region of that
LPP.

03/07/2021 Pravida Raja SXCA


Solved examples

03/07/2021 Pravida Raja SXCA


Solved examples

03/07/2021 Pravida Raja SXCA


Solved examples

03/07/2021 Pravida Raja SXCA


Solved examples

03/07/2021 Pravida Raja SXCA


Solved examples

03/07/2021 Pravida Raja SXCA

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