IE 400: Principles of Engineering Management

Study Set 1 Solutions

Spring 2021-2022

Question 1.
Decision Variables:
xij =amount of land allocated by kibbutz j for crop i,
i = 1, 2, 3 (1:sugar beets, 2:cotton, 3:sorghum), j = 1, 2, 3
Model:

max 1000(x11 + x12 + x13 ) + 750(x21 + x22 + x23 ) + 250(x31 + x32 + x33 )
s.t. x11 + x12 + x13 ≤ 600 (1)
x21 + x22 + x23 ≤ 500 (2)
x31 + x32 + x33 ≤ 325 (3)

3x11 + 2x21 + x31 ≤ 600 (4)

3x12 + 2x22 + x32 ≤ 800 (5)
3x13 + 2x23 + x33 ≤ 375 (6)

x11 + x21 + x31 ≤ 400 (7)

x12 + x22 + x32 ≤ 600 (8)
x13 + x23 + x33 ≤ 300 (9)

(x12 + x22 + x32 ) − 2(x13 + x23 + x33 ) = 0 (10)

3(x11 + x21 + x31 ) − 2(x12 + x22 + x32 ) = 0 (11)
3(x11 + x21 + x31 ) − 4(x13 + x23 + x33 ) = 0 (12)

xij ≥ 0 i = 1, 2, 3 j = 1, 2, 3

1
(1), (2), (3): Constraints for maximum quota limitations
(4), (5), (6): Constraints for water consumption limitations
(7), (8), (9): Constraints for the usable land

Note: Constraints (10), (11), (12) are obtained by linearizing the following
equations that ensures each kibbutz will plant the same proportion of its available
irrigable land:
x11 + x21 + x31 x12 + x22 + x32 x13 + x23 + x33
= =
400 600 300

Question 2.

Decision Variables:

x1 = Total number of process 1

x2 = Total number of process 2
a = Amount of A that is produced
b1 = Amount of B that is sold
b2 = Amount of B that is disposed

(Note that b1 + b2 gives the amount of B produced.)

Model:

max 16a + 14b1 − 2b2

s.t. a = 2x1 + 3x2
b1 + b2 = x1 + 2x2
2x1 + 3x2 ≤ 60
x1 + 2x2 ≤ 40
b1 ≤ 20
x1 , x2 , a, b1 , b2 ≥ 0

Note: One can remove the variables a and b2 from the model by letting
a = 2x1 + 3x2 and b2 = x1 + 2x2 − b1 (constraints 1 and 2). Then the
modified model becomes:

2
 max 16(2x1 + 3x2 ) + 14b1 − 2(x1 + 2x2 − b1 )
s.t. 2x1 + 3x2 ≤ 60
x1 + 2x2 ≤ 40
b1 ≤ 20
b1 ≤ x1 + 2x2
x1 , x2 , b1 ≥ 0

Question 3.
Decision Variables:

ci = Cash on hand at the end of month i, i=1,2,3,4

xi = Amount of tons purchased at the beginning of month i, i=1,2,3,4
yi = Amount of tons sold at the end of month i, i=1,2,3,4
Ii = Amount of tons on hand after purchase at month i, i=1,2,3,4

Parameters:

pi = Price of buying at month i, i=1,2,3,4

si = Price of selling at month i, i=1,2,3,4

Model:

max c4
s.t. Ii = Ii−1 + xi − yi−1 i = 1, · · · , 4 (Inventory Balance Equations)
ci = ci−1 − pi xi + si yi i = 1, · · · , 4 (Cash Balance Equations)
Ii ≤ 100 i = 1, · · · , 4 (Capacity Constraint)
yi ≤ Ii i = 1, · · · ,4
pi xi ≤ ci−1 i = 1, · · · ,4
I0 = 50
c0 = 1000
y0 = 0
ci , xi , yi , Ii ≥ 0 i = 1, · · · , 4

3
 Question 4.

(a) Decision Variables:

xi = Number of hours process i runs, i=1,2,3
max 9(2x1 + 2x3 ) + 10(x1 + 3x2 ) + 24x3 − (5x1 + 4x2 + x3 ) − 2(2x1 + x2 + 3x3 )
−3(3x1 + 3x2 + 2x3 )
s.t. 2x1 + x2 + 3x3 ≤ 200 (1)
3x1 + 3x2 + 2x3 ≤ 300 (2)
x1 + x2 + x3 ≤ 100 (3)
x1 , x2 , x3 ≥ 0 (4)

(b) Remove constraints (1) and (2) and add the following constraint to the
model in part (a)
(2x1 + x2 + 3x3 ) + (3x1 + 3x2 + 2x3 ) ≤ 500 =⇒ 5x1 + 4x2 + 5x3 ≤ 500
(c)

Additional Decision Variable:

y : Amount of Wonka Boxes sold

The following constraint is required:

 
x1 + 3x2
y = min 2x1 + 2x3 , , x3
2
Observe that this is not a linear constraint. It must be linearized before it
is added to the model. The equality above implies the following:
x1 + 3x2
y ≤ 2x1 + 2x3 , y ≤ , y ≤ x3
2
Then the model becomes:
max 54y − (5x1 + 4x2 + x3 ) − 2(2x1 + x2 + 3x3 )−3(3x1 + 3x2 + 2x3 )
s.t. (1) − (4)
y ≤ 2x1 + 2x3
2y ≤ x1 + 3x2
y ≤ x3
y≥0

4
Question 5.
Sets:

i : food i=1,2
j : nutrition j=1 (protein),2 (carbohydrate),3 (fat)

Decision Variables:

xi = amount of food i purchased j, i=1,2

Parameters:

Rj = minimum requirement of nutrition i, j=1,2,3 (120, 60, 25)

pij = amount of nutrition j in 1 gr of food i, i=1,2 j=1,2,3 ([35, 15, 10],[8, 20, 30])
ci = price for 1 gr of food i (7, 1.5)

Model:

min 7x1 + 1.5x2

s.t. 35x1 + 8x2 ≥ 120
15x1 + 20x2 ≥ 60
10x1 + 30x2 ≥ 25
x1 , x2 ≥ 0

Question 6.
Decision Variables:

xij = amount of product i produced at period j, i=1,2 j=1,...,12

Iij = amount of product i stored at the end of period j, i=1,2 j=1,...,12

5
 Parameters:

Dij = demand of product i at period j, i=1,2 j=1,...,12

Model:

5
X 12
X 12
X
min (5x1j + 8x2j ) + (4.5x1j + 7x2j ) + (0.2I1j + 0.4I2j )
j=1 j=6 j=1

s.t. x1j + x2j ≤ 120000 j = 1, · · · , 9

x1j + x2j ≤ 150000 j = 10, 11, 12
2I1j + 4I2j ≤ 150000 j = 1, · · · , 12
xij + Ii(j−1) = Dij + Iij i = 1, 2 j = 1, · · · , 12
Ii0 = 0 i = 1, 2
xij , Iij ≥ 0 i = 1, 2 j = 1, · · · , 12

Question 7.
Sets:

i : Candy stype i=1 (Gummy Candy),2 (Hard Candy)

j : ingredient j=1 (sugar),2 (nuts),3 (chocolate)

Decision Variables:

xij = amount of ingredient j used to produce candy i (in gr) , i=1,2 j=1,2,3
yi = amount of candy i produced (in gr), i=1,2

Parameters:

Ri,j = minimum proportion of ingredient j required in candy i , ([0, 0.22, 0],[ 0, 0.08, 0.14])
Ij = Stock level of ingredient j (in gr) (15000, 3500, 4500)
ci = price for 1 gr of candy i (20, 25)

6
Model:

max 20y1 + 25y2

s.t. x1,1 + x2,1 ≤ 1500
x1,2 + x1,2 ≤ 3500
x1,3 + x1,3 ≤ 4500
x1,2 ≥ 0.22y1
x2,2 ≥ 0.08y2
x2,3 ≥ 0.14y2
x1,1 + x1,2 + x1,3 = y1
x2,1 + x2,2 + x2,3 = y2
y1 , y2 , x1,1 , x1,2 , x1,3 , x2,1 , x2,2 , x2,3 ≥ 0

7
Question 8. Decision Variables:

x1 : The number of power units produced in machine shop 1

x2 : The number of steering wheel produced in machine shop 1
x3 : The number of aerodynamic components produced in machine shop 1
y1 : The number of power units produced in machine shop 2
y2 : The number of steering wheels produced in machine shop 2
y3 : The number of aerodynamic components produced in machine shop 2
z : The number of test-ready packages produced

Model:
max z
x 1 + y1
s.t. z ≤
2
z ≤ x2 + y 2
x3 + y3
z≤
6
x1 x2 x 3
+ + ≤ 100
4 2 9
y1 y2 y3
+ + ≤ 100
5 3 11
xi , yi ≥ 0 ∀i
z≥0

1
Question 9. Decision Variables
(
1, if player ifrom team A and player jfrom team B are matched.
xij :
0, otherwise.

Objective Function:
m X
X n
minimize xij (dij )
j=1 i=1

Constraints: n
X
xij ≤ 1 ∀j
i=1
m
X
xij ≤ 1 ∀i
j=1
m X
X n
xij = k
j=1 i=1

dij = |ai − bj | ∀i, j

xij ∈ {0, 1} ∀i, j

2
Question 10. The decision variables xij are defined as follows:

(
1, if a rook is placed on square (i, j) i, j ∈ {1, .., 8}
xij =
0, otherwise

The objective function is to maximize the total number of rooks placed

on the board, which can be expressed as:
8 X
X 8
maximize xij
i=1 j=1

Subject to the following constraints:

8
X
xij ≤ 1, ∀j ∈ {1, .., 8}
i=1
8
X
xij ≤ 1, ∀i ∈ {1, .., 8}
j=1

In this problem, the goal is to find a placement of rooks on an 8x8 chess-

board to maximize their total count while ensuring that no more than one
rook is placed in any row or column. i defines the column number and j
defines the row number.