Scribd
Upload
15 views

Homework 1 - Solution

This document contains solutions to 6 sample linear programming problems. Problem 1 involves maximizing profits from study tables and computer tables. Problem 2 involves maximizing production of hot dogs and buns. Problem 3 involves maximizing pizza production. Problem 4 involves minimizing food costs. Problem 5 involves selecting projects to maximize returns given capital constraints. Problem 6 involves minimizing cable length to connect boxes at different locations.

Uploaded by

Div 72
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
15 views

Homework 1 - Solution

This document contains solutions to 6 sample linear programming problems. Problem 1 involves maximizing profits from study tables and computer tables. Problem 2 involves maximizing production of hot dogs and buns. Problem 3 involves maximizing pizza production. Problem 4 involves minimizing food costs. Problem 5 involves selecting projects to maximize returns given capital constraints. Problem 6 involves minimizing cable length to connect boxes at different locations.

Uploaded by

Div 72
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

IMEN215 Homework #1 Solution

Note: This solution may contain typos or errors. If you find them, please let the instructor know. Thanks.

Problem #1
Study table Computer table Time availability
Skilled 2h 2h 6 peopleⅹ38 h/week =
228 h
Semi-skilled 2h 5h 11 peopleⅹ38 h/week
=
418 h
Profit $100 $160

Decision Variables:

𝑆: 𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑠𝑡𝑢𝑑𝑦 𝑡𝑎𝑏𝑙𝑒𝑠 , 𝐶: 𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑐𝑜𝑚𝑝𝑢𝑡𝑒𝑟 𝑡𝑎𝑏𝑙𝑒𝑠

Linear programming model:

Maximize 100𝑆 + 160𝐶

Subject to 2𝑆 + 2𝐶 ≤ 228
2S + 5C ≤ 418
𝑆 ≥ 0, C ≥ 0

Problem #2
Decision Variables:

𝑋1 : 𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 ℎ𝑜𝑡 𝑑𝑜𝑔𝑠 𝑡𝑜 𝑝𝑟𝑜𝑑𝑢𝑐𝑒 𝑝𝑒𝑟 𝑤𝑒𝑒𝑘 ,

𝑋2 : 𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 ℎ𝑜𝑡 𝑑𝑜𝑔 𝑏𝑢𝑛𝑠 𝑡𝑜 𝑝𝑟𝑜𝑑𝑢𝑐𝑒 𝑝𝑒𝑟 𝑤𝑒𝑒𝑘 ,

Linear programming model:

Maximize 0.8𝑋1 + 0.3𝑋2

Subject to 0.25𝑋1 ≤ 800 (pork)


0.1X2 ≤ 200 (flour)
3 2
𝑋1 + 𝑋2 ≤ 5 × 40 (labor)
60 60
𝑋1 ≥ 0, 𝑋2 ≥ 0

Problem #3
Decision Variables:

𝑋𝑖 : 𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑝𝑖𝑧𝑧𝑎𝑠 𝑜𝑓 𝑡𝑦𝑝𝑒 𝑖 (𝑖 = 1 (𝑝𝑙𝑎𝑖𝑛), 2(𝑚𝑒𝑎𝑡), 3(𝑣𝑒𝑔𝑒𝑡𝑎𝑏𝑙𝑒), 4 (𝑠𝑢𝑝𝑟𝑒𝑚𝑒))

Linear programming model:

Maximize 8𝑋1 + 10𝑋2 + 12𝑋3 + 15𝑋4

Subject to 5𝑋1 + 5𝑋2 + 5𝑋3 + 5𝑋4 ≤ 200

3𝑋1 + 3𝑋2 + 3𝑋3 + 3𝑋4 ≤ 90

4𝑋1 + 3𝑋2 + 3𝑋3 + 4𝑋4 ≤ 120

3𝑋2 + 2𝑋4 ≤ 75

3𝑋3 + 2𝑋4 ≤ 40

𝑋𝑖 ≥ 0, ∀i = 1,2,3,4

Problem #4
Decision Variables:

𝑋𝑖 : 𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑑𝑎𝑖𝑙𝑦 𝑠𝑒𝑟𝑣𝑖𝑛𝑔𝑠 𝑜𝑓 𝑠𝑡𝑒𝑎𝑘 (𝑖 = 1)𝑎𝑛𝑑 𝑝𝑜𝑡𝑎𝑡𝑜𝑒𝑠 (𝑖 = 2)

Linear programming model:

Minimize 4𝑋1 + 2𝑋2

Subject to 5𝑋1 + 15𝑋2 ≥ 50

20𝑋1 + 5𝑋2 ≥ 40

15𝑋1 + 2𝑋2 ≤ 60

𝑋𝑖 ≥ 0, ∀i = 1,2

Problem #5
Decision Variables:

1, if project 𝒊 is selected
𝑋𝑖 = { (𝑖 = 1,2,3,4)
0, otherwise

Objective function:

𝑚𝑎𝑥𝑖𝑚𝑖𝑧𝑒 𝑋1 + 0.6𝑋2 + 0.3𝑋3 + 0.5𝑋4

Constrains: By Table.
0.30𝑋1 + 0.15𝑋2 + 0.10𝑋3 + 0.15𝑋4 ≤ 0.60 (𝐴𝑣𝑎𝑖𝑙𝑎𝑏𝑙𝑒 𝑐𝑎𝑝𝑖𝑡𝑎𝑙 𝑎𝑡 1𝑠𝑡 𝑦𝑒𝑎𝑟)
0.25𝑋1 + 0.20𝑋2 + 0.06𝑋3 + 0.12𝑋4 ≤ 0.65 (𝐴𝑣𝑎𝑖𝑙𝑎𝑏𝑙𝑒 𝑐𝑎𝑝𝑖𝑡𝑎𝑙 𝑎𝑡 2𝑛𝑑 𝑦𝑒𝑎𝑟)
0.20𝑋1 + 0.15𝑋2 + 0.08𝑋3 + 0.10𝑋4 ≤ 0.40 (𝐴𝑣𝑎𝑖𝑙𝑎𝑏𝑙𝑒 𝑐𝑎𝑝𝑖𝑡𝑎𝑙 𝑎𝑡 2𝑛𝑑 𝑦𝑒𝑎𝑟)

In summary,

Minimize 𝑋1 + 0.6𝑋2 + 0.3𝑋3 + 0.5𝑋4

Subject to 0.30𝑋1 + 0.15𝑋2 + 0.10𝑋3 + 0.15𝑋4 ≤ 0.60


0.25𝑋1 + 0.20𝑋2 + 0.06𝑋3 + 0.12𝑋4 ≤ 0.65
0.20𝑋1 + 0.15𝑋2 + 0.08𝑋3 + 0.10𝑋4 ≤ 0.40
𝑋𝑖 ∈ {0,1}, 𝑖 = 1,2,3,4

Problem #6
• Length of cables connecting two locations (𝑥, 𝑦) and (𝑥 ′ , 𝑦 ′ ) = |𝑥 − 𝑥 ′ | + |𝑦 − 𝑦 ′ |

• Let (𝑥, 0) be the coordinate of the box, which is the decision variable in this problem

• Total length of cable required = |𝑥 − 5| + |0 − 8| + |𝑥 − 10| + |0 − 15| + |𝑥 − 25| + |0 − 10|


= |𝑥 − 5| + |𝑥 − 10| + |𝑥 − 25| + 33

In summary,

Minimize |𝑥 − 5| + |𝑥 − 10| + |𝑥 − 25| + 33

Subject to 𝑥 𝑓𝑟𝑒𝑒

You might also like