Math 171A Homework Assignment #1: Linear Programming, Assignments of Mathematics

A university-level mathematics homework assignment focused on linear programming. The assignment includes finding the optimal solution to an lp problem, drawing the feasible region, converting an lp to standard form, and understanding constraint normal vectors. Students are expected to solve problems involving finding the maximum value of a linear function subject to certain constraints.

Typology: Assignments

Pre 2010

Uploaded on 03/28/2010

koofers-user-pld
koofers-user-pld 🇺🇸

8 documents

1 / 1

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Math 171A Homework Assignment # 1
Instructor: Jiawang Nie
Assigned Date: January 6, 2010 Due Date: January 13, 2010
1. Find the optimal solution to the following LP
maximize x1+ 4x2+ 3x3
subject to 2x1+x2+x34
x1x3= 1
x20, x30.
2. Draw the feasible region defined by the following six constraints:
x1+ 2x26, x1x22, x21, x1x24, x10, x20.
Find all the corner points.
3. Convert the following LP into the standard form (minimize cTxsubject to Ax b)
minimize x1+ 2x2+ 3x3
subject to 2 x1+x23
4x1+x35
x10, x20, x30.
4. Consider the inequality constraint aTxbwhere a6= 0. Show that starting from any point
on its boundary, the constraint normal points into the infeasible half-space.
5. Transform the following optimization equivalently into an LP of the standard form (minimize
cTxsubject to Ax b)
minimize |x|+|y|+|z|
subject to x+y1
2x+z= 3.
1

Partial preview of the text

Download Math 171A Homework Assignment #1: Linear Programming and more Assignments Mathematics in PDF only on Docsity!

Math 171A Homework Assignment # 1

Instructor: Jiawang Nie

Assigned Date: January 6, 2010 Due Date: January 13, 2010

  1. Find the optimal solution to the following LP

maximize x 1 + 4x 2 + 3x 3 subject to 2 x 1 + x 2 + x 3 ≤ 4 x 1 − x 3 = 1 x 2 ≥ 0 , x 3 ≥ 0.

  1. Draw the feasible region defined by the following six constraints:

x 1 + 2x 2 ≤ 6 , x 1 − x 2 ≥ 2 , x 2 ≤ 1 , x 1 − x 2 ≤ 4 , x 1 ≥ 0 , x 2 ≥ 0.

Find all the corner points.

  1. Convert the following LP into the standard form (minimize cT^ x subject to Ax ≥ b)

minimize x 1 + 2x 2 + 3x 3 subject to 2 ≤ x 1 + x 2 ≤ 3 4 ≤ x 1 + x 3 ≤ 5 x 1 ≥ 0 , x 2 ≥ 0 , x 3 ≥ 0.

  1. Consider the inequality constraint aT^ x ≤ b where a 6 = 0. Show that starting from any point on its boundary, the constraint normal points into the infeasible half-space.
  2. Transform the following optimization equivalently into an LP of the standard form (minimize cT^ x subject to Ax ≥ b) minimize |x| + |y| + |z| subject to x + y ≤ 1 2 x + z = 3.