Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
LINEAR PROGRAMMING
A. Statement of the Problem
Each weekend in his spare time, Boggs uses his wood lathe to produce either
Jack Rice model baseball bats or Mitch Gedman model bats. He spends 20
hours each weekend in this pursuit. Each Jack Rice bat requires 30 minutes
machine time while each Mitch Gedman bat requires 25 minutes of machine
time. Next week, Boggs has a firm commitment to deliver 25 Jack Rice bats.
Otherwise, he can expect to sell as many bats as he can produce. Jack Rice
bats contribute P450 per bat to profit, and Mitch Gedman bats yield a contribution
of P400 per bat. How many of each type of bat would Boggs make this weekend
in order to maximize profit?
B. Variable Representation
Let:
x = number of Jack Rice model bats
y = number of Mitch Gedman model bats
P = profit
C. Objective Function
Maximize P = 450x + 400y
D. Constraints
Tabular Form
Making
Delivery
Total minutes
available per
weekend
1200
Firm Commitments
Jack Rice bats
Mitch Gedman bats
25
0
Algebraic Form
Making: 30x + 25y 1200
Delivery: x 25
Non-negativity constraints: x 0 & y 0
30
25
20
15
10
5
0
0
10
15
20
25
30
35
40
45
50
Coordinates
(25,18)
(25,0)
(40,0)
G. Final Answer
In order for Boggs to maximize his profit, which is P 18,450, he needs to make 25
Jack Rice model bats and 18 Mitch Gedman bats this weekend.