Scribd
Upload
207 views5 pages

Solution of Linear Programing Problems Graphical Method

This document discusses solving linear programming problems using the graphical method. It explains that a linear programming problem can have a unique optimal solution, multiple optimal solutions, an unbounded solution, no feasible solution, or a single feasible solution. It provides examples of these different cases. The document also defines key terms like feasible solution, feasible region, and extreme point. It includes a sample problem demonstrating how to graphically represent the constraints and identify the optimal solution as the point with the maximum value of the objective function.

Uploaded by

beena saleem
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
207 views5 pages

Solution of Linear Programing Problems Graphical Method

This document discusses solving linear programming problems using the graphical method. It explains that a linear programming problem can have a unique optimal solution, multiple optimal solutions, an unbounded solution, no feasible solution, or a single feasible solution. It provides examples of these different cases. The document also defines key terms like feasible solution, feasible region, and extreme point. It includes a sample problem demonstrating how to graphically represent the constraints and identify the optimal solution as the point with the maximum value of the objective function.

Uploaded by

beena saleem
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/ 5

Linear Programming Graphical Method Instructor: Miss Urooj

Solution of Linear Programing Problems


Graphical Method.
Some Exceptional Cases
We discussed a number of linear programming problems and
optimal solution for each of them was unique.
In general a linear programming problem may have.
 A definite and unique optimal solution.
 Multiple optimal solution.
 An unbound solution
 No feasible solution (infeasible solution)
 A single solution

Multiple optimal solution

1|Page
Linear Programming Graphical Method Instructor: Miss Urooj

An unbound solution

No feasible solution (infeasible solution)

2|Page
Linear Programming Graphical Method Instructor: Miss Urooj

Definitions:
Feasible solution: A solution that satisfies all the constraints.

Feasible region: The set of all feasible solutions.

Standard form: A linear program in which all the constraints are written
as equalities. The optimal solution of the standard form of a linear
program is the same as the optimal solution of the original formulation
of the linear program.

Extreme point: Graphically speaking, extreme points are the feasible


solution points occurring at the vertices or “corners” of the feasible
region. With two-variable problems, extreme points are determined by
the intersection of the constraint lines.

3|Page
Linear Programming Graphical Method Instructor: Miss Urooj

Practice Problems
Question:
Find the maximum value of Z= 2𝑥 + 𝑦
Subject to,
𝑥 + 2𝑦 ≤ 10
𝑥+𝑦 ≤6
𝑥−𝑦 ≤2
𝑥 − 2𝑦 ≤ 1
𝑥, 𝑦 ≥ 0
Solution:
Standard form:
𝑥 + 2𝑦 = 10
𝑥+𝑦 =6
𝑥−𝑦 =2
𝑥 − 2𝑦 = 1

Plot line 𝑥 + 2𝑦 = 10 by joining two points (0, 5) and (10, 0).


Plot line 𝑥 + 𝑦 = 6 by joining two points (0, 6) and (6, 0)
Plot line 𝑥 − 𝑦 = 2 by joining two points (0, -2) and (12, 10)
Plot line 𝑥 − 2𝑦 = 1 by joining two points (0, -0.5) and (11, 5)

12

10

6
B
4 A
C
2 D
F E
0
0 2 4 6 8 10 12 14
-2

-4

4|Page
Linear Programming Graphical Method Instructor: Miss Urooj

To find the optimal solution


The co-ordinates of the six vertices of the convex region ABCDE are
A(0,5), B(2,4), C(4, 2), D(3,1) E(1,0) , and F(0,0).
Values of the object function Z= 2𝑥 + 𝑦 at these vertices are
𝑍(𝐴) = 5, 𝑍(𝐵) = 8, 𝑍(𝐶) = 10,
𝑍(𝐷) = 7, 𝑍(𝐸) = 2 𝑎𝑛𝑑 𝑍(𝐹) = 0

Answer
The maximum value of Z is 10 and which occurs at the point C(4, 2).
Hence the solution to the given problem is
𝑥 = 4, 𝑦 = 2 𝑎𝑛𝑑 𝑍𝑚𝑎𝑥 = 10

5|Page

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