OPERATION RESEARCH

ME354

OPERATION RESEARCH

Lecture -4

Graphical Method

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 Problem(LPP)

Understand the given Problem

Structure and the Formulation of LPP

Convert to Linear Programming Problem

Two Aspects
1. Formulation
2. Solution 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

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- 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- Formulation

Step 1 : Clearly define the decision variables

Step 2 : Construct the objective function

Step 3 : Formulate the constraints

Step 4 : Implementation

NITK , Surathkal
OPERATION RESEARCH

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

Graphical Method NITK , Surathkal

 Graphical Method
OPERATION RESEARCH

NITK , Surathkal
OPERATION RESEARCH Graphical Method

NITK , Surathkal
OPERATION RESEARCH Graphical Method

NITK , Surathkal
OPERATION RESEARCH Graphical Method

NITK , Surathkal
OPERATION RESEARCH Graphical Method

NITK , Surathkal
OPERATION RESEARCH

NITK , Surathkal
OPERATION RESEARCH Graphical Method- Example 2

Minimization Z= 5x1 + 2x2

s.t. 2x1 + 5x2 > 10

4x1 - x2 > 12
x1 + x2 > 4

x1, x2 > 0

NITK , Surathkal
OPERATION RESEARCH Graphical Method- Example 2

Graph the Constraints

Constraint 1: When x1 = 0, then x2 = 2; when x2 = 0, then x1 = 5. Connect (5,0) and (0,2).
The ">" side is above this line: check that (0,0) is not in the feasible area.
Constraint 2: When x2 = 0, then x1 = 3. But setting x1 to 0 will yield x2 = -12, which is not
on the graph. Thus, to get a second point on this line, set x1 to any number larger than 3 and
solve for x2: when x1 = 5, then x2 = 8. Connect (3,0) and (5,8).
The ">" side is to the right.
Constraint 3: When x1 = 0, then x2 = 4; when x2 = 0, then x1 = 4. Connect (4,0) and (0,4).
The ">" side is above this line.
NITK , Surathkal
OPERATION RESEARCH Graphical Method- Example 2
x2 6
Feasible Region
5
4x1 - x2 > 12
4
x1 + x2 > 4
3

2 2x1 + 5x2 > 10

x1
1 2 3 4 5 6 NITK , Surathkal
OPERATION RESEARCH Graphical Method- Example 2
6
x2
5

4
Optimal Solution:
3 x1 = 16/5, x2 = 4/5,
5x1 + 2x2 = 17.6
2

x1
1 2 3 4 5 6 NITK , Surathkal
OPERATION RESEARCH

NITK , Surathkal