AMAT 160

Second Semester AY 20152016

Exam 1

Due: 19 February, 4:30PM

General Directions: Do not consult anyone except your teacher. Show clear, complete
and concise solutions to earn full points. Show strictly handwritten answers. Submit
your answers on sheets of paper, double-spaced. Each question is worth 10 points
(please refer to the rubric for scoring).
1. A large pansit firm from Davao has two production plants, two sources of raw ingredient,
and three distribution centers. The following tables show the transportation costs between
the sources and the plants, as well as between the plants and the distribution centers.

Source 1
Source 2

Panabo Plant
40/kg
80/kg

Agdao
Market
Panabo Plant 160/kg
Digos Plant
120/kg

Digos Plant
60/kg
60/kg

Bankerohan
Market
80/kg
160/kg

Calinan
Market
40/kg
80/kg

Sources 1 and 2 has available 800 and 900 kilograms of raw ingredients, respectively. The
three distribution markets need 7200, 16800, and 2700 kilograms of raw materials, respectively. The plants have unlimited processing capacity.
(a) Formulate a linear program that finds the shipping scheme from sources to plants that
minimizes the total transportation cost.
(b) Reduce the linear program to a single standard transportation problem with two sources
and three destinations (markets). (Hint: Find the minimum cost paths from sources to
markets).
(c) Suppose that the Panabo plant has a processing limit of 7200 kilograms, and the Digos
plant has a processing limit of 6300 tons. Show how to reduce the problem to two
separate standard transportation problems.
2. Convert the following optimization problem into a standard linear program (Hint: For any
real number x, we can find u, v 0 such that |x| = u + v, then the value of x in terms of
u, v.):
(a)
Min

|x1 | + 2 |x2 | |x3 |

subject to
x1 + x2 x3 10
x1 3x2 + 2x3 = 12

(b)
Min

|x1 5| + 2 |x2 + 4|

subject to
x1 + x2 10
x1 3x2 2
3. Let


P = (x1 , x2 ) R2 |x1 + x2 40, 2x1 + x2 60, x1 20, x1 , x2 0
Consider the optimization problem
Minimize z
subject to x P.
(a) Draw the graph of P .
(b) Using the standard equality form of P, generate all basic feasible solutions and their
corresponding endpoints to the graph of P .
(c) Which extreme point/s correspond to degenerate basic feasible solution/s? Why?
(d) Use the graphic method to solve the problem with the following objective functions:
i. z = x1 x2 ;
ii. z = 2x1 x2 .
4. Show that the set of all optimal solutions to a (standard) linear programming problem is a
convex set.
5. Prove the resolution theorem by mathematical induction method. Follow the following
scheme:
Let p be the number of positive components of x P . When p = 0, x = 0 is obviously
an extreme point of P . Assume that the theorem holds for p = 0, 1, . . . , k and x has k + 1
positive components. If x is an extreme point, then there is nothing

 to prove. If x is not

an extreme point, we let xT = [x1 , . . . , xk+1 ] > 0 and A = A|N

. Then by a previous
Rk+1 such
theorem, the columns of A are
dependent, i.e., there exists a vector w
 Tlinearly

T
n
w
w
= 0. Define w = w
, 0 R , then w 6= 0 and Aw = A
= 0. There are three
that A
possible cases: w 0, w < 0, and w has both positive and negative components.
For w 0, let x () = x+w and pick the largest negative value of such that x = x ( )
has at least one more zero component than x. Then use the induction hypothesis to show
the theorem holds. In a similar manner, show that in the remaining two cases, the theorem
still holds.