Quiz 2 - Linear Programming Completo
Quiz 2 - Linear Programming Completo
1.) What is the problem with the following linear programming model?
min 𝑍 = 10𝑋 + 3𝑌
s.t.
𝑋+𝑌 ≥5
𝑋≤2
𝑌≤2
𝑋, 𝑌 ≥ 0
a. Infeasibility
b. Unboundedness
c. Redundancy
d. Alternative Optimal Solutions
e. There is no problem (there is a unique solution)
2.) What is the problem with the following linear programming model?
max 𝑍 = 4𝑋 + 2𝑌
s.t.
2𝑋 + 𝑌 ≤ 7
𝑌≥2
𝑋, 𝑌 ≥ 0
a. Infeasibility
b. Unboundedness
c. Redundancy
d. Alternative Optimal Solutions
e. There is no problem (there is a unique solution)
X + Y =4
X = 2 -- > (2) + Y = 4 -- > Y = 2
(2 , 0) -- > Z = 6
(4 , 0) -- > Z = 12
(2 , 2) -- > Z = 16
What are the optimal values of X, Y, and Z? Write them on the line below.
What is the shadow price of the first constraint? Write your answer on the line below.
What is the shadow price of the second constraint? Write your answer on the line below.
4. The Heinlein and Krampf Brokerage firm has just been instructed by one of its clients to
invest $250,000 of her money obtained recently through the sale of land holdings. She requests
that the firm select whatever stocks and bonds they believe are well rated, but within the
following guidelines.
(a) Municipal bonds should constitute at least 20% of the investment.
(b) At least 40% of the funds should be placed in a combination of electronic firms, aerospace
firms, and medicine manufacturers.
(c) No more than 50% of the amount invested in municipal bonds should be placed in a high-
risk, high-yield nursing home stock.
Subject to these restraints, the client’s goal is to maximize projected return on investments.
The analysts and Heinlein and Krampf, aware of these guidelines, prepare a list of high-
quality stocks and bonds and their corresponding rates of return:
Investment Projected Rate of Return (%)
Lost Angeles Municipal Bonds 5.3
Thompson Electronics, Inc. 6.8
United Aerospace Corp. 4.9
Palmer Medicine 8.4
Happy Days Nursing Homes 11.8
Formulate this portfolio selection problem using linear programming. You do not need to
solve it.
X1 = Money invested in Municipal Bonds
X 2 = Money invested in Thompson Electronic
X 3 = Money invested in United Aerospace Corp
X 4 = Money invested in Palmer Medicine
X 5 = Money invested in Happy Days Nursing Homes
Objective Function
Max Z = 5.3X1 + 6.8X 2 + 4.9X 3 + 8.4X 4 + 11.8X 5
s.t.
X1 + X 2 + X 3 + X 4 + X 5 ≤ 250.000
X1 ≥ 0.2 (X1 + X 2 + X 3 + X 4 + X 5 )
X 2 + X 3 + X 4 ≥ 0.4(X1 + X 2 + X 3 + X 4 + X 5 )
X 5 ≤ 0.5X1
X1 , X 2 , X 3 , X 4 , X 5 ≥ 0