Question

Consider the following linear programming problem. Maximize $P = 3x + 6y$ subject to the constraints $x + 3y \le 12$ $-2x - 3y \ge -18$ $x \ge 0, y \ge 0$. (a) Write the linear programming problem as a standard maximization problem. Maximize $P = $ Subject to $\le 12$ $\le 18$ $x \ge 0$ $y \ge 0$ (b) Write the initial simplex tableau. x y u v P Constant 12 18 0

          Consider the following linear programming problem.
Maximize $P = 3x + 6y$ subject to the constraints
$x + 3y \le 12$
$-2x - 3y \ge -18$
$x \ge 0, y \ge 0$.
(a) Write the linear programming problem as a standard maximization problem.
Maximize
$P = $
Subject to
$\le 12$
$\le 18$
$x \ge 0$
$y \ge 0$
(b) Write the initial simplex tableau.
x
y
u
v
P
Constant
12
18
0

Consider the following linear programming problem.
Maximize P = 3x + 6y subject to the constraints
x + 3y ≤ 12
-2x - 3y ≥ -18
x ≥ 0, y ≥ 0.
(a) Write the linear programming problem as a standard maximization problem.
Maximize
P =
Subject to
≤ 12
≤ 18
x ≥ 0
y ≥ 0
(b) Write the initial simplex tableau.
x
y
u
v
P
Constant
12
18
0

Added by Karen S.

Elementary and Intermediate Algebra

Alan S. Tussy, R. David Gustafson 5th Edition

Instant Answer

Solved by Expert Suzanne W.

Step 1

To do this, we introduce slack variables to convert the inequalities into equalities. (a) The standard maximization problem is: Maximize $P = 3x + 6y$ subject to $x + 3y + s_1 = 12$ $2x - 3y + s_2 = 18$ $x \geq 0, y \geq 0, s_1 \geq 0, s_2 \geq 0$ Show more…

Show all steps

Thanks for your feedback!

Consider the following linear programming problem_ Maximize P = 3x + 6y subject to the constraints X + 3y < 12 ~2x - 3y > -18 x 2 0, y 2 0. (a) Write the linear programming problem as a standard maximization problem_ Maximize subject to <12 <18 X 2 0 Y > 0 (b) Write the initial simplex tableau: Constant 12 18