Scribd
Upload
71 views27 pages

Operation Management (Linear Programming Problems) : Prof. Ashutosh Kar

The document provides an overview of linear programming problems and their formulation and solution. It discusses how linear programming problems seek to maximize or minimize an objective function subject to linear constraints. The key aspects covered include: - Formulating linear programming problems by defining decision variables, the objective function, and linear inequality constraints. - Graphically representing problems on a 2D graph to find the feasible region and optimal solution. - Using theorems to determine whether optimal solutions occur at corner/vertex points of the feasible region. - Demonstrating the formulation and graphical solution of sample linear programming problems to minimize or maximize objectives subject to resource constraints.

Uploaded by

SUBHANKAR PANDA
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
71 views27 pages

Operation Management (Linear Programming Problems) : Prof. Ashutosh Kar

The document provides an overview of linear programming problems and their formulation and solution. It discusses how linear programming problems seek to maximize or minimize an objective function subject to linear constraints. The key aspects covered include: - Formulating linear programming problems by defining decision variables, the objective function, and linear inequality constraints. - Graphically representing problems on a 2D graph to find the feasible region and optimal solution. - Using theorems to determine whether optimal solutions occur at corner/vertex points of the feasible region. - Demonstrating the formulation and graphical solution of sample linear programming problems to minimize or maximize objectives subject to resource constraints.

Uploaded by

SUBHANKAR PANDA
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/ 27

Prof.

Ashutosh Kar

Operation Management (Linear


Programming Problems)
Agenda

◼ Brief Introduction
◼ Linear Programming
Operation Management?

◼ Designing, Operating and Improving


productive systems

◼ Transformation of resources into Goods and/or


Services
Brief History

◼ Late 1700s: Industrial Revolution


▪ Mechanized production
▪ No worry about efficiency
◼ Early 1900s: Scientific Management
▪ Fredrik Taylor/ Henry Ford
◼ Mid 1900s: Operations Research
▪ Linear Programming
▪ Simulation
▪ PERT/CPM
▪ Waiting Line theory and much more
Linear Programming
Consider the question

◼ A furniture dealer deals in only two


items–tables and chairs. He has Rs 50,000 to
invest and has storage space of at most 60
pieces. A table costs Rs 2500 and a chair Rs
500. Profit from a table is Rs 250 and that
from the chair is Rs 75.

◼ How many tables and chairs should he buy?


Linear Programming Problem
(LPP)
◼ Seek to Maximise (e.g. Profit) or Minimize
(e.g. Cost)
◼ Often called “Optimization” problems
◼ Deals with Resource Constraints
▪ What are the constraints here?
◼ Relationships between variables are Linear
◼ Have wide use in the Industry
▪ E.g. Production, Nutrition, Transportation,
Stocking
Formulation of Problem

◼ Decision Variables (Decision)


◼ Objective Function (Optimization)
◼ Linear Inequalities (Constraints)

◼ Can you formulate the problem yourself?


Problem Formulation

◼ x = Number of tables
◼ y = Number of chairs

◼ Profit (maximize) Z = 250 x + 75 y

Constraints
◼ Finance: 2500 x + 500 y ≤ 50,000
▪ Or 5 x + y ≤ 100
◼ Storage: x + y ≤ 60
◼ x, y ≥ 0
Various Methods to Solve

◼ Graphical Method
◼ Simplex Method
◼ Excel Solver
Graphical Method

◼ Simplest LPPs have only two decision


variables
◼ Hence, the problem can be represented in a
two-dimensional graph

◼ Steps
▪ Find the feasible region for the decision variables
▪ Find the optimum solution inside the region
Find Feasible Region

◼ Convert the inequality into equality


▪ x + y = 60
▪ 2500 x + 500 y = 50000 or 5x + y = 100
◼ Draw the straight lines corresponding to the
linear equations
◼ Find the area where the solution must lie
Y
axis • Z (max) = 250 x + 75 y

• 5 x + y = 100 ---- i
• x + y = 60 ---- ii

X
axis
The Graph
Minimization Problem
Now solve this:
◼ A farmer can buy two types of plant food, Mix A and Mix
B. Each cubic metre of mix A contains 20 kg of phosphoric
acid, 30 kg of nitrogen, and 5 kg of potash. Each cubic
metre of mix B contains 10 kg of phosphoric acid, 30 kg of
nitrogen and 10 kg of potash. The minimum monthly
requirements are 460 kg of phosphoric acid, 960 kg of
nitrogen, and 220 kg of potash.
◼ If mix A costs Rs.30 per cubic metre and mix B costs Rs. 35
per cubic metre, how many cubic metres of each mix should
the farmer blend to meet the minimum monthly
requirements at a minimal cost? What is the cost?
Problem Formulation
◼ A farmer buys Mix A and Mix B (how much of these is
◼ X = Mix A in cubic
our decision)
metre
◼ Y = Mix B in cubic
◼ Each cubic metre of mix A contains 20 kg of phosphoric
metre
acid, 30 kg of nitrogen, and 5 kg of potash.
◼ Phosphoric Acid
◼ Each cubic metre of mix B contains 10 kg of phosphoric
◼ 20x + 10 y >= 460
acid, 30 kg of nitrogen and 10 kg of potash.
◼ 2x + y >= 46
◼ Nitrogen
◼ Constraints
◼ 30x + 30 y >= 960
▪ Phosphoric acid >= 460 kg
◼ x + y >= 32
▪ Nitrogen >= 960 kg
◼ Potash
▪ Potash >= 220 kg
◼ 5x + 10y >= 220
◼ x + 2y >= 44
◼ Cost
◼ x, y >= 0
▪ Mix A costs Rs.30 per cubic metre
▪ Mix B costs Rs. 35 per cubic metre
◼ Z (min) = 30x + 35y
◼ Objective: Minimization of cost
Y
◼ 2x + y = 46 ---- i
axis
◼ x + y = 32 ---- ii
◼ x + 2y = 44 ---- iii
50
(0, 46)
◼ Z (min) = 30x +
40 35y

30 (0,
32)
(14, Minimum value of Z at (20, 12), equal to 1020
20
(0, 18)
22) (20,
10
12)

(23, (32, (44, 0)


0) 0)
10 20 30 40 50 X
axis
2x + y = 46
x+y= x + 2y =
32 44
Theorems and Feasibility of
Solutions
Theorem-1

◼ Theorem 1: Let R be the feasible region


(convex polygon) for a linear programming
problem and let Z = ax + by be the objective
function. When Z has an optimal value
(maximum or minimum), it must occur at a
corner point (vertex) of R.
Theorem-1

◼ Theorem 2: Let R be the feasible region for a


linear programming problem, and let Z = ax +
by be the objective function. If R is bounded,
then the objective function Z has both a
maximum and a minimum value on R and
each of these occurs at a corner point (vertex)
of R.
Corollary

◼ If R is unbounded, then a maximum or a


minimum value of the objective function may
not exist. However, if it exists, it must occur at
a corner point of R. (By Theorem 1)
Example: No Minimum even at a
corner point
Determine graphically the minimum value of the
objective function
◼ Z = – 50x + 20y ... (1)

Subject to the constraints:


◼ 2x – y ≥ – 5 ... (2)
◼ 3x + y ≥ 3 ... (3)
◼ 2x – 3y ≤ 12 ... (4)
◼ x ≥ 0, y ≥ 0 ... (5)
Graph to find Minimum
How to prove there is no minimum
or maximum at the corner point?
◼ Find out the feasible region R and all the corner
points
◼ Evaluate the objective function Z = ax + by at
each corner point to find out min or max as
required (which occurs, let’s say, at corner point
‘p’)
◼ Let’s say the value of Z at corner point ‘p’ is K
◼ Draw a new line ax + by = K. This line must pass
through the point ‘p’.
◼ If this new line has any other common point with
the feasible region R, then Z has no minimum (or
maximum) at the corner point ‘p’
Practice problem to solve
graphically:
Solve the following LPP:

◼ Maximise Z = 4x + y ... (1)

Subject to the constraints:


◼ x + y ≤ 50 ... (2)
◼ 3x + y ≤ 90 ... (3)
◼ x ≥ 0, y ≥ 0 ... (4)
Thank You!

You might also like