assignment5 - maximize 3 x 3 subject to x 2 + x 3 4-x 2 + x...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
ORIE 3300/5300 ASSIGNMENT 5 Fall 2011 Individual work. Due: 11am, Tuesday October 4. (a) Introduce slack variables in the linear program below. Then solve it us- ing the simplex method. Use the slacks as the initial basic variables. At each iteration, use the “smallest subscript rule”: whenever the simplex method allows you a choice between several possible entering variables, choose the one with the smallest subscript, and use the same rule when the method allows you a choice between possible leaving variables.
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: maximize 3 x 3 subject to x 2 + x 3 4-x 2 + x 3 x 1 + x 3 4-x 1 + x 3 x 1 , x 2 , x 3 . (b) At which iterations was the basic feasible solution degenerate? (c) Which of the pivots you performed are degenerate? (d) Sketch a three-dimensional picture of the feasible region. (e) Which, if any, of the four constraints is redundant? In other words, which, if any, constraint could you delete without changing the feasible region? 1...
View Full Document

Ask a homework question - tutors are online