Scribd
Upload
3 views2 pages

M1 T3 Graphical solution

The document outlines various types of solutions to Linear Programming Problems (LPP), including feasible, infeasible, basic, and optimum basic feasible solutions. It describes the graphical solution methods for LPPs with two variables, focusing on the extreme point solution method and the steps involved in determining the feasible region and optimal solutions. Additionally, it provides several example problems to illustrate the application of the graphical method in solving LPPs.

Uploaded by

neeraj
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
3 views2 pages

M1 T3 Graphical solution

The document outlines various types of solutions to Linear Programming Problems (LPP), including feasible, infeasible, basic, and optimum basic feasible solutions. It describes the graphical solution methods for LPPs with two variables, focusing on the extreme point solution method and the steps involved in determining the feasible region and optimal solutions. Additionally, it provides several example problems to illustrate the application of the graphical method in solving LPPs.

Uploaded by

neeraj
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/ 2

Solutions to LPP

Solution: The set of values of decision variables 𝑥𝑗 (𝑗 = 1,2,3, … , 𝑛) that satisfy the
constraints of an LPP is said to constitute the solution of that LPP.

Feasible solution: The set of values of decision variables 𝑥𝑗 (𝑗 = 1,2,3, … , 𝑛) that satisfy
all the constraints and non-negativity conditions of an LPP simultaneously is said to
constitute the feasible solution of that LPP.

Infeasible solution: The set of values of decision variables 𝑥𝑗 (𝑗 = 1,2,3, … , 𝑛) that do not
satisfy all the constraints and non-negativity conditions of an LPP simultaneously is said to
constitute the feasible solution of that LPP.

Basic solution: For a set of 𝑚 simultaneous equations in 𝑛 variables (𝑛 > 𝑚) in an LPP, a


solution obtained by setting (𝑛 − 𝑚) variables equal to zero and solving for remaining 𝑚
variables is called a basic solution of that LPP.

The (𝑛 − 𝑚) variables whose value did not appear in basic solution are called non
basic variables and the remaining 𝑚 variables are called basic variables.

Basic feasible solution: A feasible solution of an LPP which is also the basic solution is
called the basic feasible solution. Basic feasible solutions are of two types:

a) Degenerate solution: A basic feasible solution is called degenerate if the value of at least
one basic variable is zero.
b) Non-degenerate solution: A basic feasible solution is called non-degenerate if the value
of all the 𝑚 basic variables are non-zero and non-negative.
Optimum basic feasible solution: A basic feasible solution that optimises the
objective function value of the LPP is called the optimum basic feasible solution.
Unbounded solution: A solution that can increase or decrease infinitely the value of the
objective function of the LPP is called an unbounded solution.
Graphical solution method
For LPP that have only two variables, it is possible that entire set of feasible solutions
can be displayed graphically by plotting linear constraints on a graph paper in order to locate
the best solution. Two main graphical solution methods are:
a) Extreme point solution method
b) Iso-profit (cost) function line method.

a) Extreme Point Solution Method


In this method, the coordinates of all corner (or extreme) points of the feasible
region (space or area) are determined and then value of the objective function at
each of these points is computed and compared. The coordinates of an extreme
point where the optimal (maximum or minimum) value of the objective function is
found represent solution of the given LP problem. The steps of the method are
summarized as follows:
Step 1 : Develop an LP model - State the given problem in the mathematical
LP model as illustrated in the previous chapter.

Step 2 : Plot constraints on graph paper and decide the feasible region
i. Replace the inequality sign in each constraint by an equality sign.
ii. Draw these straight lines on the graph paper and decide each time the area of
feasible solutions according to the inequality sign of the constraint. Shade the
common portion of the graph that satisfies all the constraints simultaneously
drawn so far.
iii. The final shaded area is called the feasible region (or solution space) of the given LP
problem. Any pointinside this region is called feasible solution and this provides
values of x1 and x2 that satisfy all the
constraints.
Step 3 : Examine extreme points of the feasible
solution spaceto find an optimal solution
i. Determine the coordinates of each extreme point of the feasible solution space.
ii. Compute and compare the value of the objective function at each extreme point.
Identify the extreme point that gives optimal (max. or min.) value of the objective
function.

Problems

1. Use the graphical method to solve the following LP problem.


Maximize 𝑍 = 15𝑥1 + 10𝑥2 , subject to the constraints
4𝑥1 + 6𝑥2 ≤ 360, 3𝑥1 ≤ 180, 5𝑥2 ≤ 200
𝑥1 , 𝑥2 ≥ 0.

2. Use the graphical method to solve the following LP problem.


Maximize 𝑍 = 2𝑥1 + 𝑥2 , subject to the constraints

𝑥1 + 2𝑥2 ≤ 10, 𝑥1 + 𝑥2 ≤ 6, 𝑥1 – 𝑥2 ≤ 2, 𝑥1 – 2𝑥2 ≤ 1

𝑥1 , 𝑥2 ≥ 0.
3. Use the graphical method to solve the following LP problem
Minimize 𝑍 = 3𝑥1 + 2𝑥2 , subject to the constraints
5𝑥1 + 𝑥2 ≥ 10, 𝑥1 + 𝑥2 ≥ 6, 𝑥1 + 4𝑥2 ≥ 12
𝑥1 , 𝑥2 ≥ 0.
4. Use the graphical method to solve the following LP problem
Minimize = 200𝑥1 + 400𝑥2 , subject to the constraints

𝑥1 + 𝑥2 ≥ 200, 𝑥1 + 3𝑥2 ≥ 400, 𝑥1 + 2𝑥2 ≤ 350

𝑥1 , 𝑥2 ≥ 0.

5. Use the graphical method to solve the following LP problem.


Maximize = 7𝑥1 + 3𝑥2 , subject to the constraints
𝑥1 + 2𝑥2 ≥ 3, 𝑥1 + 𝑥2 ≤ 4, 0 ≤ 𝑥1 ≤ 5/2, 0 ≤ 𝑥2 ≤ 3/2.
6. Use the graphical method to solve the following LP problem.
Minimize 𝑍 = 20𝑥1 + 10𝑥2 subject to the constraints
𝑥1 + 2𝑥2 ≤ 40, 3𝑥1 + 𝑥2 ≥ 30, 4𝑥1 + 3𝑥2 ≥ 60

𝑥1 , 𝑥2 ≥ 0.

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