Scribd
Upload
7 views6 pages

Graphical Method

The document discusses linear programming problems that have two variables and how their feasible solutions can be displayed graphically by plotting linear constraints on a graph paper to locate the optimal solution. It also defines key terms related to linear programming problems including feasible solution, infeasible solution, basic solution, basic feasible solution, degenerate solution, non-degenerate solution, and optimum basic feasible solution.

Uploaded by

Priyanka Naik
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
7 views6 pages

Graphical Method

The document discusses linear programming problems that have two variables and how their feasible solutions can be displayed graphically by plotting linear constraints on a graph paper to locate the optimal solution. It also defines key terms related to linear programming problems including feasible solution, infeasible solution, basic solution, basic feasible solution, degenerate solution, non-degenerate solution, and optimum basic feasible solution.

Uploaded by

Priyanka Naik
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/ 6

Linear Programming: The

Graphical Method
• 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 decision
variables x1, x2, . . ., xn, 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 solutions can be displayed graphically by plotting
linear constraints on a graph paper in order to locate the best
(optimal) solution.
IMPORTANT DEFINITIONS
• Solution: The set of values of decision variables xj ( j = 1, 2, . . ., n) that
satisfy the constraints of an LP problem is said to constitute the
solution to that LP problem

• Feasible solution The set of values of decision variables xj ( j = 1, 2, . .


., n) that satisfy all the constraints and non-negativity conditions of
an LP problem simultaneously is said to constitute the feasible
solution to that LP problem.
• Infeasible solution The set of values of decision variables xj ( j = 1, 2, .
. ., n) that do not satisfy all the constraints and non-negativity
conditions of an LP problem simultaneously is said to constitute the
infeasible solution to that LP problem

• Basic solution: For a set of m simultaneous equations in n variables


(n > m) in an LP problem, a solution obtained by setting (n – m)
variables equal to zero and solving for remaining m equations in m
variables is called a basic solution of that LP problem.
• 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 m basic variables is non-zero and positive.
• 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

• Unbounded solution A solution that can increase or decrease


infinitely the value of the objective function of the LP problem is
called an unbounded solution

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