Question

Solve the following linear programming problem using the method of corners: Objective: Minimize $P = 68x + 61y$ Subject to: $x - y \leq -4$ $4x - 3y \leq -13$ $x \geq -1, y \leq 8$ Enter DNE for each blank if such a value does not exist. If there are infinitely many solutions, list the two corner points on the corresponding line segment with a comma between them. The minimum of $P = 68x + 61y$ is and occurs?

          Solve the following linear programming problem using the method of corners:
Objective:
Minimize $P = 68x + 61y$
Subject to:
$x - y \leq -4$
$4x - 3y \leq -13$
$x \geq -1, y \leq 8$
Enter DNE for each blank if such a value does not exist. If there are infinitely many solutions, list the two corner points on the
corresponding line segment with a comma between them.
The minimum of $P = 68x + 61y$ is
and occurs?

Solve the following linear programming problem using the method of corners:
Objective:
Minimize P = 68x + 61y
Subject to:
x - y ≤ -4
4x - 3y ≤ -13
x ≥ -1, y ≤ 8
Enter DNE for each blank if such a value does not exist. If there are infinitely many solutions, list the two corner points on the
corresponding line segment with a comma between them.
The minimum of P = 68x + 61y is
and occurs?

Added by Joseph G.

Calculus: Early Transcendentals

James Stewart 8th Edition

Instant Answer

Solved by Expert Joseph David

Step 1

First, we need to graph the constraints. - The first constraint is y < -4/8, which is equivalent to y < -1/2. This is a horizontal line passing through (0, -1/2). - The second constraint is y < -13/8, which is equivalent to y < -1.625. This is also a horizontal Show more…

Show all steps

Thanks for your feedback!

Solve the following linear programming problem using the method of corners: Objective: Subject = Minimize P = 681 - 61y v < -4 8y < -13 Iz-1,0< 8 Enter DNE for each blank if such value does not exist; If there are infinitely many solutions, list the two corner points on the corresponding line segment with FoA between them; The minimum of P 681 Gly is and occur.