
Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Material Type: Assignment; Class: OPTIMIZATION; Subject: Mathematics; University: University of California - Los Angeles; Term: Fall 2005;
Typology: Assignments
1 / 1
This page cannot be seen from the preview
Don't miss anything!

Math 164, Lecture 2, Vese Homework #5, due on Wednesday, November 2nd, 2005
Remarks:
[1] Consider a linear program with the constraints in standard form Ax = b and x ≥ ~ 0. (a) Recall the definition of a direction of unboundedness. (b) Prove that if d 6 = ~0 satisfies Ad = ~0 and d ≥ ~ 0 , then d is a direction of unboundedness for these constraints. (c) Prove that, if d is a direction of unboundedness for these constraints, then −d cannot be a direction of unboundedness. (d) Let {d 1 , .., dk } be directions of unboundedness for these constraints. Prove that a nonzero vector d =
∑k i=1 αidi, with^ αi^ ≥^ 0 is also a direction of unboundedness.
[2] Suppose that a linear program in standard form, with bounded feasible region, has l optimal extreme points {v 1 , v 2 , ..., vl}. Prove that a point is optimal for the linear program if, and only if, it can be expressed as a convex combination of {v 1 , v 2 , ..., vl}.
[3] Convert the following linear program to standard form:
minimize z = x 1 − 5 x 2 − 7 x 3 , subject to
5 x 1 − 2 x 2 + 6x 3 ≥ 5 3 x 1 + 4x 2 − 9 x 3 = 3 7 x 1 + 3x 2 + 5x 3 ≤ 9 x 1 ≥ − 2 , x 2 , x 3 free.
[4] Solve the following linear program using the simplex method (graph the feasible region, and outline the progress of the solution).
maximize z = 7x 1 + 8x 2 , subject to
4 x 1 + x 2 ≤ 100 x 1 + x 2 ≤ 80 x 1 ≤ 40 x 1 , x 2 ≥ 0.
[5] Consider the linear program
minimize z = − 5 x 1 − 7 x 2 , subject to
− 3 x 1 + 2x 2 ≤ 30 − 2 x 1 + x 2 ≤ 12 x 1 , x 2 ≥ 0. (a) Draw a graph of the feasible region and determine two linearly-independent directions of unboundedness. (b) Convert the linear program to standard form and determine two linearly-independent direc- tions of unboundedness for this version of the problem. Verify that the directions of unboundedness satisfy Ad = ~0 and d ≥ ~0.