In Exercises 3 – 6, find vectors b and c and matrix A so that each problem is set up as a canonical linear programming problem: Maximize c^Tx subject to Ax ≤ b and x ≥ 0. Do not find the solution.

Transcribed Image Text:

Minimize subject to x₁ + 5x₂ - 2x3 2x₁ + x₂ + 4x3 ≤ 27 x₁6x₂ + 3x3 ≥ 40 and x₁ ≥ 0, x₂ ≥ 0, X3 ≥ 0.