Linear Algebra and Its Applications · Problem 8.3.11

Linear Programming and Game Theory — Gilbert Strang

Mathematics · linear-programming-minimize-no-simplex

Problem

(a) Without the simplex method, minimize the cost

5x_1 + 3x_2 + 4x_3

, subject to

x_1 + x_2 + x_3 \geq 1

x_1 \geq 0

x_2 \geq 0

x_3 \geq 0

. (b) What is the shape of the feasible set? (c) What is the dual problem, and what is its solution

y