Homework 1

Problem 2. Product Mix Problem (Winston’s OR Book, pp.67 Example 3)

Decision Variables
x1= number of trucks produced daily
x2= number of cars produced daily
Objective Function: Max. Profit
Min z= 3x1+2x2
Constraints
Const.1.Paint shop constraint
RHS represents 1 day
(1/40)x1+(1/60)x2 ≤ 1
Const.2. Body shop constraint
(1/50)x1+(1/50)x2 ≤ 1
Technological coefficients represents the fractions of a day
Sign Restrictions
x1≥0, x2≥0
Homework 2
Problem 4. Feed Mix Problem (Taha’s OR Book 7th. Ed. pp.18 Example 2.2-2)

Decision Variables
x1= lb of corn in the daily feed mix
x2= lb of soybean in the daily feed mix
Objective Function: Min. Cost
Min z= 0.3x1+0.9x2
Constraints
Const.1. x1+x2 ≥800
Const.2. 0.09x1+0.60x2 ≥0.3(x1+x2) Rearrangement is required
0.21x1-0.30x2 ≤0
Const.3. 0.02x1+0.06x2 ≤ 0.5(x1+x2) Rearrangement is required
0.03x1-0.01x2 ≥ 0
Sign Restrictions
x1≥0, x2≥0
Homework 3
Problem 6. Bus Scheduling Problem (Taha’s OR Book 7th. Ed. pp.53 Example 2.5-3)

Decision Variables
x1= number of buses starting at 12.00 a.m.
x2= number of buses starting at 4.00 a.m.
…
x6= number of buses starting at 8.00 p.m.
Objective function: min. the total number of buses in operation
Min z= x1+x2+x3+x4+x5+x6
Constraints
Const.1. x1+x6 ≥4
Const.2. x1+x2 ≥8
Const.3. x2+x3 ≥10
Const.4. x3+x4 ≥7
Const.5. x4+x5 ≥12
Const.6. x5+x6 ≥4
Sign Restrictions x1≥0, x2≥0, x3≥0, x4≥0, x5≥0, x6≥0
Homework 4
Problem 8. (Production Planning Problem)
Decision Variables
xi= the number of units of variant i (i=1,2,3,4) made per year

Objective Function: Max Profit

Max z= 1.5x1+2.5x2+3.0x3+4.5x4

Constraints
Operation time limits
2x1+4x2+3x3+7x4 ≤100 000
3x1+2x2+3x3+4x4 ≤50 000
2x1+3x2+2x3+5x4 ≤60 000

Sign Restrictions
x1≥0, x2≥0, x3≥0, x4≥0