Scribd
Upload
104 views

Quiz 2 - Linear Programming

The document contains a quiz with 4 multiple choice questions about linear programming problems. The first question asks about a linear programming model that minimizes Z=10X + 3Y subject to the constraints X + Y ≥ 5, X ≤ 2, Y ≤ 2, and non-negativity constraints. The second question asks about a linear programming model that maximizes Z=4X + 2Y subject to the constraints 2X + Y ≤ 7, Y ≥ 2, and non-negativity constraints. The third question asks to solve a linear programming problem graphically that maximizes Z=3X + 5Y subject to the constraints X + Y ≤ 4, X ≥ 2, and non-neg

Uploaded by

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

Quiz 2 - Linear Programming

The document contains a quiz with 4 multiple choice questions about linear programming problems. The first question asks about a linear programming model that minimizes Z=10X + 3Y subject to the constraints X + Y ≥ 5, X ≤ 2, Y ≤ 2, and non-negativity constraints. The second question asks about a linear programming model that maximizes Z=4X + 2Y subject to the constraints 2X + Y ≤ 7, Y ≥ 2, and non-negativity constraints. The third question asks to solve a linear programming problem graphically that maximizes Z=3X + 5Y subject to the constraints X + Y ≤ 4, X ≥ 2, and non-neg

Uploaded by

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

Quiz 2: Linear Programming

Administración de Operaciones

1.) What is the problem with the following linear programming model?
min Z=10 X +3 Y
s.t.
X +Y ≥ 5
X ≤2
Y ≤2
X , Y ≥0
a. Infeasiblity
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 Z=4 X +2 Y
s.t.
2 X +Y ≤7
Y ≥2
X , Y ≥0
a. Infeasibility
b. Unboundedness
c. Redundancy
d. Alternative Optimal Solutions
e. There is no problem (there is a unique solution)

3.) Solve the following linear programming problem graphically.


max Z=3 X +5 Y
s.t.
X +Y ≤ 4
X ≥2
X , Y ≥0
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.

You might also like