Scribd
Upload
10 views14 pages

Linear Programming and Applications: (Ii) Graphical Method

The document discusses the graphical method for solving linear programming problems (LPP), focusing on maximizing an objective function subject to constraints. It outlines the steps involved in visualizing the optimization process, identifying the feasible region, and determining the optimal point. Additionally, it describes different cases of optimal solutions, including unique, unbounded, multiple, infeasible, and unique feasible points.

Uploaded by

Ayush Kishore
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
10 views14 pages

Linear Programming and Applications: (Ii) Graphical Method

The document discusses the graphical method for solving linear programming problems (LPP), focusing on maximizing an objective function subject to constraints. It outlines the steps involved in visualizing the optimization process, identifying the feasible region, and determining the optimal point. Additionally, it describes different cases of optimal solutions, including unique, unbounded, multiple, infeasible, and unique feasible points.

Uploaded by

Ayush Kishore
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 14

Linear Programming and

Applications
(ii) Graphical method

Water Resources Planning and Management: M3L2 D Nagesh Kumar, IISc


Objectives

 To visualize the optimization procedure explicitly

 To understand the different terminologies associated with

the solution of LPP

 To discuss an example with two decision variables

2 Water Resources Planning and Management: M3L2 D Nagesh Kumar, IISc


Example

Maximize Z 6 x  5 y
subject to 2 x  3 y 5 (c-1)

x  3 y 11 (c-2)

4 x  y 15 (c-3)

x , y 0 (c-4 & c-5)

3 Water Resources Planning and Management: M3L2 D Nagesh Kumar, IISc


Graphical method: Step - 1

Plot all the constraints


one by one on a graph
paper

4 Water Resources Planning and Management: M3L2 D Nagesh Kumar, IISc


Graphical method: Step - 2

Identify the common


region of all the
constraints.

This is known as
‘feasible region’

5 Water Resources Planning and Management: M3L2 D Nagesh Kumar, IISc


Graphical method: Step - 3

Plot the objective function


assuming any constant, k,
i.e. 6 x  5 y k

This is known as ‘Z line’,


which can be shifted
perpendicularly by
changing the value of k.

6 Water Resources Planning and Management: M3L2 D Nagesh Kumar, IISc


Graphical method: Step - 4
Notice that value of the objective
function will be maximum when it
passes through the intersection of
x  3 y 11 4 x and
y 15
(straight lines associated with
2nd and 3rd constraints).

This is known as ‘Optimal Point’

7 Water Resources Planning and Management: M3L2 D Nagesh Kumar, IISc


Graphical method: Step - 5

Thus the optimal point of the


present problem is
x * 3.091
y * 2.636

And the optimal solution is


6 x*  5 y * 31.726

8 Water Resources Planning and Management: M3L2 D Nagesh Kumar, IISc


Different cases of optimal solution

A linear programming problem may have

1. A unique, finite solution (example already discussed)

2. An unbounded solution,

3. Multiple (or infinite) number of optimal solution,

4. Infeasible solution, and

5. A unique feasible point.

9 Water Resources Planning and Management: M3L2 D Nagesh Kumar, IISc


Unbounded solution: Graphical
representation

Situation: If the feasible region is


not bounded

Solution: It is possible that the


value of the objective function
goes on increasing without
leaving the feasible region, i.e.,
unbounded solution

10 Water Resources Planning and Management: M3L2 D Nagesh Kumar, IISc


Multiple solutions: Graphical
representation

Situation: Z line is parallel to any


side of the feasible region

Solution: All the points lying on


that side constitute optimal
solutions

11 Water Resources Planning and Management: M3L2 D Nagesh Kumar, IISc


Infeasible solution: Graphical
representation

Situation: Set of constraints does


not form a feasible region at all
due to inconsistency in the
constraints

Solution: Optimal solution is not


feasible

12 Water Resources Planning and Management: M3L2 D Nagesh Kumar, IISc


Unique feasible point: Graphical
representation
Situation: Feasible region consist
of a single point. Number of
constraints should be at least
equal to the number of decision
variables

Solution: There is no need for


optimization as there is only
one feasible point

13 Water Resources Planning and Management: M3L2 D Nagesh Kumar, IISc


Thank You

Water Resources Systems Planning and Management: M3L2 D. Nagesh Kumar, IISc

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