hw3 - Homework 3 Due: February 10, 2009 Exercise 4, page...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Homework 3 Due: February 10, 2009 Exercise 4, page 101 : Consider the following LP maximize z = x 1 subject to 5 x 1 + x 2 = 4 6 x 1 + x 3 = 8 3 x 1 + x 4 = 3 x 1 , x 2 , x 3 , x 4 0 . (a) Solve the problem by inspection , and justify your answer in terms of the basic feasible solutions of the simplex method. (b) Repeat (a) assuming that the objective function calls for minimizing z = x 1 . Exercise 5, page 101: Solve the following problem by inspection, and justify your answer in terms of the basic feasible solutions of the simplex method. maximize z = 5 x 1 - 6 x 2 + 3 x 3 - 5 x 4 + 12 x 5 subject to x 1 + 3 x 2 + 5 x 3 + 6 x 4 + 3 x 5 90 x 1 , x 2 , x 3 , x 4 , x 5 0 . Hint: A basic solution here consists of one variable only. Modified Exercise 6, page 101 : The following tableau represents a specific simplex iteration. All variables are non- negative. The tableau is not optimal for either maximization or a minimization problem. Basic
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 2

hw3 - Homework 3 Due: February 10, 2009 Exercise 4, page...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online