Professional Documents
Culture Documents
Types of Models
Total Integer Model: All decision variables required to have
integer solution values.
0–1 Integer Model: All decision variables required to have
integer values of zero or one.
Also referred to as Boolean,True/False, Binary
Mixed Integer Model: Some of the decision variables (but
not all) required to have integer values.
1
A Total Integer Model
Example
The owner of a machine shop is planning to expand by
purchasing some new machines presses and lathes. The owner
has estimated that each press purchased will increase profit by
$100 per day and each lathe will increase profit by $150 daily.
The number of machines the owner can purchase is limited by
the cost of the machines and the available floor space in the
shop. The machine purchase prices and space requirements are
as follows:
A Total Integer Model (1 of 2)
Required Floor
Machine Purchase
Space
Price
(sq. ft.)
Press 15 $8,000
Lathe 30 4,000
3
A Total Integer Model (2 of 2)
4
A 0-1 Integer Model Example
A community council must decide which recreation
facilities to construct in its community. Four new
recreation facilities have been proposed a swimming
pool, a tennis center, an athletic field, and a
gymnasium. The council wants to construct facilities
that will maximize the expected daily usage by the
residents of the community, subject to land and cost
limitations. The expected daily usage and cost and
land requirements for each facility follow:
Expected Land
Recreation Usage Requirements
Facility (people/day) Cost (acres)
Swimming 300 $35,000 4
pool
Tennis center 90 10,000 2
Athletic field 400 25,000 7
Gymnasium 150 90,000 3
7
A 0–1 Integer Model (2 of 2)
9
A Mixed Integer Model Example
Nancy Smith has $250,000 to invest in three
alternative investments: condominiums, land, and
municipal bonds. She wants to invest in the
alternatives that will result in the greatest return on
investment after 1 year.
12
Integer Programming Example
Graphical Solution of Maximization Model
Optimal Solution:
Z = $1,055.56
x1 = 2.22 presses
x2 = 5.55 lathes
Both of these may be found by judicious Feasible Solution Space with Integer Solution Points
rounding, but the value of the objective
function needs to be checked for each.
13
Harrison Electric Company Example of
Integer Programming by Enumeration
The Company produces two products popular with
home renovators, old-fashioned chandeliers and
ceiling fans
Both the chandeliers and fans require a two-step
production process involving wiring and assembly
It takes about 2 hours to wire each chandelier and 3
hours to wire a ceiling fan
Final assembly of the chandeliers and fans requires 6
and 5 hours respectively
The production capability is such that only 12 hours
of wiring time and 30 hours of assembly time are
available
Harrison Electric Company Example of
Integer Programming
Each chandelier produced nets the firm $7 and each
fan $6
Harrison’s production mix decision can be formulated
using LP as follows
4–
+ = Possible Integer Solution
+
3– Optimal LP Solution
(X1 =3.75, X2 = 1.5,
+ + + Profit = $35.25)
2–
2X1 + 3X2 ≤ 12
+ + + +
1–
| | | | | | |
1 2 3 4 5 6 X1
0–
Harrison Electric Company Example of
Integer Programming
The production planner Wes recognizes this is an
integer problem
His first attempt at solving it is to round the values to
X1 = 4 and X2 = 2
However, this is not feasible
Rounding X2 down to 1 gives a feasible solution, but it
may not be optimal
This could be solved using the enumeration method
Enumeration is generally not possible for large
problems
Harrison Electric Company Example of
Integer Programming
CHANDELIERS (X1) CEILING FANS (X2) PROFIT ($7X1 + $6X2) Integer
0 0 $0 solutions
1 0 7
2 0 14
3 0 21
4 0 28
5 0 35 Optimal solution to
0 1 6 integer programming
problem
1 1 13
2 1 20
3 1 27
4 1 34 Solution if rounding
0 2 12
is used
1 2 19
2 2 26
3 2 33
0 3 18
1 3 25 Table 11.1
0 4 24
Harrison Electric Company Example of
Integer Programming