1.

Exam 2
1. The Overnight Food Processing Company prepares sandwiches (among other
processed food
items) for vending machines, markets, and business canteens around the city. The
sandwiches are
made at night and delivered early the following morning. Any sandwiches not purchased
during
the previous day are thrown away. Three kinds of sandwiches are made each night, a
basic cheese
sandwich (x1), a ham salad sandwich (x2), and a pimento cheese sandwich (x3). The
profits are
$1.25, $2.00, and $1.75, respectively. It takes 0.5 minutes to make a cheese sandwich, 1.2
minutes to
make a ham salad sandwich, and 0.8 minutes to make a pimento cheese sandwich. The
company,
has 20 hours of labor available to produce the sandwiches each night. The demand for
ham salad
sandwiches is at least as great as the demand for the two types of cheese sandwiches
combined.
However, the company has only enough ham salad to produce 500 sandwiches per night.
The company wants to formulate the linear programming model in order to determine how many
of
each type of sandwich to make to maximize profit.
2.
Given the following cost table for an assignment problem, determine the optimal
assignment
and compute total minimum cost. Identify all alternative solutions if there are multiple
optimal
solutions.
Machine
Operator
A
B
C
D
1
$10
$2
$8
$6
2
9
5
11
9
3
12
7
14
14
4
3
1
4
2
3.
Coal is mined and processed at the following four mines in Kentucky, West Virginia, and
Virginia.
Location Capacity (tons)
A. Cabin Creek
90
B. Surry
50
C. Old Fort
80

D. McCoy

60
280
These mines supply the following amount of coal to utility power plants in three cities.
Plant Demand (tons)
1. Richmond
120
2. Winston-Salem 100
3. Durham
110
330
The railroad shipping costs ($1,000s) per ton of coal are shown in the following table.
Because of
railroad construction, shipments are now prohibited from Cabin Creek to Richmond.
From
A
B
C
D

1
$7
12
7
9

To
2
$10
9
3
5

3
$5
4
11
7

Formulate and solve linear programming problem