Or - Lecture 2 - LP Formulation
Or - Lecture 2 - LP Formulation
Guarantees the optimal solution to the model formulated (if one exists).
Need to determine:
Model parameters;
Decision variables;
Objective function;
Constraints
There are two things you would typically do for the objective functions:
Maximize it, such as with the cases of profits or revenues
Minimize it, such as when dealing with costs
Resource Requirements
Labor Clay Profit
Product
(hr/unit) (lb/unit) ($/unit)
Bowl 1 4 40
Mug 2 3 50
Resource
40 hr/day 120 lbs
Availability
• Non-Negativity Constraints
x1 0 and x2 0
Electronic 4 3 240
Assembly 2 1 100
Profit per unit $7 $5
• Decision Variables:
X1 = number of Product 1 units to be produced Xi = number of Product “i” units
X2 = number of Product 2 units to be produced to be produced, for all i = 1 to 2
• Objective Function:
Maximize Profit = $7X1 + $5X2
• Subject to:
4X1 + 3X2 ≤ 240 (hours of electronic time)
Electronic time used is ≤ Electronic time available
2X1 + 1X2 ≤ 100 (hours of assembly time)
Assembly time used is ≤ Assembly time available
X1 & X2 > 0 (Non-negativity constraints)
14 OR – Introduction to Linear Programming
Example 3 – Resource Utilization
A chemicals manufacturer produces two types of photo-developing
fluids.
The first black-and-white picture chemical, costs $2,500 per ton to produce.
The second a colour photo chemical costs $3,000 per ton.
Based on analysis of current inventory levels and outstanding orders,
it has been specified that at least 30 tons of the black-and-white
chemical and at least 20 tons of the colour chemical must be
produced during the next month.
The manager has noted that both chemicals must be used within a
month; thus, to avoid wasting expensive raw material, at least 60 tons
of the photo chemicals must be produced.
Determine the amount to be produced from each picture chemical to
minimize total cost.
Objective Function
Minimize total cost = 2,500X1 + 3,000X2
Subject to:
X1 ≥ 30 (tons of black-and-white chemical)
X2 ≥ 20 (tons of colour chemical)
X1 + X2 ≥ 60 (tons total)
X1 , X2 ≥ 0 (non-negativity requirements)
16 OR – Introduction to Linear Programming
Example 4 – Airline Flights
A local Airline Company is considering air service from its hub of operations
in Germany to Rome, and Dublin. They have one gate at Berlin Airport, which
operates 12 hours per day.
Each flight requires 1 hour of gate time and the pilot crew labour is limited to
150 hours per day.
Each flight to Rome consumes 15 hours of pilot crew time and is expected to
produce a profit of €2,500. The market for service to Rome is limited to 9
flights per day.
Serving Dublin uses 10 hours of pilot crew time per flight and will result in a
profit of €2,000 per flight.
Determine the number of daily flights to Rome and Dublin to maximize total
profit.
17 OR – Introduction to Linear Programming
Example 4 – Airline Flights (Cont’d)
Decision Variables
x1 = number of flights per day to Rome
x2 = number of flights per day to Dublin
Objective Function
Minimize Z = £3x1 + £5x2
Functional Constraints
x1 + x2 = 1,000 (kg total)
x1 500 (kg of chicken)
x2 200 (kg of beef)
x1 - 2x2 0 (or x1/x2 2/1)
x 1, x 2 0 (non-negativity requirements)
20 OR – Introduction to Linear Programming
Example 6 – Bus Schedule
Alexandria is studying the feasibility of introducing a mass
transit bus system that will reduce the pollution problem by
reducing in-city driving.
The initial study seeks the determination of the minimum
number of buses that can handle transportation needs.
After gathering necessary information, the city engineer
noticed that the minimum number of buses needed to meet
requirements fluctuates with the time of the day.
The next figure summarizes the engineer’s findings. It was
decided that to carry out the required daily maintenance,
each bus could operate only 8 successive hours a day.
21 OR – Introduction to Linear Programming
Example 6 – Bus Schedule (Cont’d)
• Decision variables:
X1: Number of buses starting at 12:01 A.M.
X2: Number of buses starting at 04:01 A.M.
X3: Number of buses starting at 08:01 A.M.
X4: Number of buses starting at 12:01 P.M.
X5: Number of buses starting at 04:01 P.M.
X6: Number of buses starting at 08:01 P.M.
Subject to:
X1 + X6 > 4 (12:01 A.M. to 4:00 A.M. constraint)
X1 + X2 > 8 ( 4:01 A.M. to 8:00 A.M. constraint)
X2 + X3 > 10 ( 8:01 A.M. to 12:00 noon constraint)
X3 + X4 > 7 (12:01 P.M. to 4:00 P.M. constraint)
X4 + X5 > 12 ( 4:01 P.M. to 8:00 P.M. constraint)
X5 + X6 > 4 ( 8:01 A.M. to 12:00 midnight constraint)
Questions?
[email protected]