QUIZ LINEAR PROGRAMMING

Section 1
1. Minimize c = x + y
subject to : x + 2y 6
2x + y 6
x 0, y

2. Minimize c = x + 2y
subject to : x + 3y 30

3. Maximize p = x 2y
subject to : x + 2y 8

2x + y 30

x 6y 0

x 0, y 0

3x 2y 0
x 0, y 0

Section 2
1. A small company consisting of two carpenters and a finisher produce and sell two types
of tables: type A and type B. The type-A table will result in a profit of $50, and each typeB table will result in a profit of $54. A type-A table requires 3 hours of carpentry and 1
hour of finishing. A type-B table requires 2 hours of carpentry and 1 hour of finishing.
Each day there are 16 hours available for carpentry and 8 hours available for finishing.
How many tables of each type should be made each day to maximize profit?
2. ABC mining company operates two mines for the purpose of extracting gold and silver.
The Saddle mine costs $14,000/day to operate, and it yields 50 oz of gold and 3000 oz of
silver each day. The Horseshoe mine costs $16,000/day to operate, and it yields 75 oz of
gold and 1000 oz of silver per day. Company management set a target of at least 650 oz
of gold and 18000 oz of silver. If the company wants to minimize cost, formula an LP
model for this problem. Do not solve the LP problem.