Mathematical Programming: Problem Solving With Mathematical Models
Mathematical Programming: Problem Solving With Mathematical Models
Problem Solving
with Mathematical Models
1
Operations Research
2
OR Process
Assessment
Abstraction Interpretation
Analysis
Model Model solution
3
Math Modeling is Only One Part of
Problem Solving
4
OR models
5
Mathematical Programs
6
The model consists of:
• Decision variables
• Constraints
• Objective function
7
Example
Leather Limited manufactures two types of
leather belts: the deluxe model and the regular
model. Each type requires 1 square meter of
leather. A regular belt requires 1 hour of skilled
labor and a deluxe belt requires 2 hours of
skilled labor. Each week, 40 square meters of
leather and 60 hours of skilled labor are
available. Each regular belt contributes $3
profit and each deluxe belt $4. Write an LP to
maximize profit.
8
The decision variables are:
x1 = number of deluxe belts produced weekly
x2 = number of regular belts produced weekly
9
Example 2
12
Example 4
The Chic Sheet Company have to plan production for the next week.
The firm produces two types of sheet, standard and luxury, in packs
that are sold to retailers for $80 and $145 respectively. The costs of
materials are $25 per pack of standard sheets and $45 per pack of
luxury sheets. These materials are available in unlimited amounts.
There are three production departments, cutting, machining and
packing. The workforce includes 10 cutters, 150 machinists and 40
packers. The labor required per pack for each product and the labor
charges for each department are: The factory works a 37.5-hour week .
Standard Luxury Charge per hour ($)
Cutting 0.25 0.375 40
Machining 2.50 6.250 8
Packing 1.25 1.250 12
13
Standard Luxury
Selling price 80 145
Less:
Direct materials 25 45
Cutting 10 15
Machining 20 50
Packing 15 15
Total deduction 70 125
Profit 10 20
14
Let x = packs of Standard produced
and y = packs of Luxury produced
Maximize: Z= 10x + 20y
Subject to:
0.25x + 0.375y ≤ 375 (cutting)
2.5x + 6.25y ≤ 5625 (machining)
1.25x + 1.25y ≤1500 (packing)
15
Feasible - Optimal
16
Parameters – Output Variables
17