(2) Consider the following LPP in canonical form: maximize subject to a₁x₁ ++ anxn+y=t=b x1,, xn, y, t ≥ 0, Y here a₁,, an, b>0. Note that the variables in this problem are x₁, , xn, y, and t. ... (a) Find all BFS. (b) Find all basic directions at the BFS (0,...,0, b, 0). (c) Use the optimality theorem to decide if the BFS (0,...,0, b, 0) is a maximizer. Hint: what is the cost in the different basic directions at the given BFS.

(2) Consider the following LPP in canonical form: maximize subject to a₁x₁ ++ anxn+y=t=b x1,, xn, y, t ≥ 0, Y here a₁,, an, b>0. Note that the variables in this problem are x₁, , xn, y, and t. ... (a) Find all BFS. (b) Find all basic directions at the BFS (0,...,0, b, 0). (c) Use the optimality theorem to decide if the BFS (0,...,0, b, 0) is a maximizer. Hint: what is the cost in the different basic directions at the given BFS.

Linear Algebra: A Modern Introduction

4th Edition

ISBN:9781285463247

Author:David Poole

Publisher:David Poole

Chapter2: Systems Of Linear Equations

Section2.4: Applications

Problem 16EQ

See similar textbooks