OPERATION RESEARCH

ME354

OPERATION RESEARCH

Lecture -6

Graphical Method –Special cases

NITK , Surathkal
OPERATION RESEARCH What is Linear Programming?

• Linear programming is a mathematical programming

technique to optimize performance (e.g. profit or cost) under a
set of resource constraints (e.g. machine-hours, man-hours,
money, materials, etc.) as specified by an organization.

NITK , Surathkal
OPERATION RESEARCH Linear Programming

Step 1. Formulation
Step 2. Solution
✓ Graphical solution
✓ Simplex Method
✓ Big M Method
✓ Dual Simplex Method
✓ Two Phase model
NITK , Surathkal
OPERATION RESEARCH Linear Programming

➢ A feasible solution satisfies all the problem's constraints.

➢ An optimal solution is a feasible solution that results in the largest
possible objective function value when maximizing (or smallest
when minimizing).
➢ A graphical solution method can be used to solve a linear program
with two variables.

NITK , Surathkal
OPERATION RESEARCH Graphical Method- Parameters

Decision variables - mathematical symbols representing levels of activity of a firm.

Objective function - a linear mathematical relationship describing an objective of

the firm, in terms of decision variables - this function is to be maximized or
minimized.

Constraints – requirements or restrictions placed on the firm by the operating

environment, stated in linear relationships of the decision variables.

Parameters - numerical coefficients and constants used in the objective function

and constraints. NITK , Surathkal
OPERATION RESEARCH Graphical Method-Procedure

A Graphical Solution Procedure (LPs with 2 decision variables can be solved)

1. Plot each constraint as an equation and then decide which side of the line is
feasible
2. Find the feasible region
3. Find the coordinates of the corner (extreme) points of the feasible region.
4. Substitute the corner point coordinates in the objective function
5. Choose the optimal solution

NITK , Surathkal
OPERATION RESEARCH Graphical Method- Special Cases

Case 1 : An unique Optimal Solution

Case 2 : An infinite number of optimal Solution

Case 3 : An unbounded Solution

Case 4 : No solution

NITK , Surathkal
OPERATION RESEARCH Graphical Method- Special Cases

Case 1 : An unique Optimal Solution

NITK , Surathkal
OPERATION RESEARCH Case 1 : An unique Optimal Solution

NITK , Surathkal
OPERATION RESEARCH

Objectives ? Maximization of the Profit

Budget constrain &

Constrains ?
Demand constrain
NITK , Surathkal
OPERATION RESEARCH

Tabular Form
Products Cost of Profit per Unit Total Demand
Production
A 200 20
500
B 150 15

Production 50,000
Budget

Convert to Mathematical Form NITK , Surathkal

OPERATION RESEARCH

NITK , Surathkal
OPERATION RESEARCH

NITK , Surathkal
OPERATION RESEARCH Graphical Method- Special Cases

Case 2 : An infinite number of optimal Solution

NITK , Surathkal
OPERATION RESEARCH 2. An infinite number of optimal Solution

NITK , Surathkal
OPERATION RESEARCH 2. An infinite number of optimal Solution

NITK , Surathkal
OPERATION RESEARCH 2. An infinite number of optimal Solution

NITK , Surathkal
OPERATION RESEARCH 2. An infinite number of optimal Solution

NITK , Surathkal
OPERATION RESEARCH 2. An infinite number of optimal Solution

NITK , Surathkal
OPERATION RESEARCH 2. An infinite number of optimal Solution

NITK , Surathkal
OPERATION RESEARCH 2. An infinite number of optimal Solution

-60

40

NITK , Surathkal
OPERATION RESEARCH 2. An infinite number of optimal Solution

C
Corner Points
B

Feasible Region
D
A

NITK , Surathkal
OPERATION RESEARCH 2. An infinite number of optimal Solution

Z = 600
(60,30) Optimal
Solution
Z = 400 Z = 600
(40,20) (80,20)
Z = 600
(100,10)

Z = 300 Feasible Region Z = 600

(60,0) (120,0)

NITK , Surathkal
OPERATION RESEARCH 2. An infinite number of optimal Solution

The maximum value of Z

lies between C &D. Since
there are infinity points
on the line joining C &D C Optimal
Solution
and gives the same Max
value of Z. Hence there is
infinity optimal solutions Feasible Region
for this LPP D

NITK , Surathkal
OPERATION RESEARCH Graphical Method- Special Cases

Case 3 : An unbounded Solution

NITK , Surathkal
OPERATION RESEARCH Case 3 : An unbounded Solution

NITK , Surathkal
OPERATION RESEARCH Case 3 : An unbounded Solution

NITK , Surathkal
OPERATION RESEARCH Case 3 : An unbounded Solution

NITK , Surathkal
OPERATION RESEARCH Case 3 : An unbounded Solution

NITK , Surathkal
OPERATION RESEARCH Case 3 : An unbounded Solution

NITK , Surathkal
OPERATION RESEARCH Case 3 : An unbounded Solution

NITK , Surathkal
OPERATION RESEARCH Case 3 : An unbounded Solution

NITK , Surathkal
OPERATION RESEARCH Case 3 : An unbounded Solution

NITK , Surathkal
OPERATION RESEARCH Case 3 : An unbounded Solution

NITK , Surathkal
OPERATION RESEARCH Graphical Method- Special Cases

Case 4 : No Solution

NITK , Surathkal
OPERATION RESEARCH
Case 4 : No Solution

NITK , Surathkal
OPERATION RESEARCH
Case 4 : No Solution

NITK , Surathkal
OPERATION RESEARCH
Case 4 : No Solution

NITK , Surathkal
OPERATION RESEARCH
Case 4 : No Solution

NITK , Surathkal
OPERATION RESEARCH
Case 4 : No Solution

NITK , Surathkal
OPERATION RESEARCH
Case 4 : No Solution

NITK , Surathkal
OPERATION RESEARCH
Case 4 : No Solution

NITK , Surathkal
OPERATION RESEARCH Binding Constraints

NITK , Surathkal
OPERATION RESEARCH Binding Constraints

NITK , Surathkal
OPERATION RESEARCH Binding Constraints

NITK , Surathkal
OPERATION RESEARCH Slack and Surplus Variables

NITK , Surathkal
OPERATION RESEARCH Slack and Surplus Variables

NITK , Surathkal
OPERATION RESEARCH Slack and Surplus Variables

NITK , Surathkal
OPERATION RESEARCH Slack and Surplus Variables

NITK , Surathkal
OPERATION RESEARCH Slack and Surplus Variables

NITK , Surathkal
OPERATION RESEARCH Slack and Surplus Variables

NITK , Surathkal
OPERATION RESEARCH Slack and Surplus Variables

NITK , Surathkal
OPERATION RESEARCH Slack and Surplus Variables

NITK , Surathkal
OPERATION RESEARCH Slack and Surplus Variables

NITK , Surathkal
OPERATION RESEARCH Slack and Surplus Variables

NITK , Surathkal
OPERATION RESEARCH Slack and Surplus Variables

NITK , Surathkal