Chapter 11.8, Problem 9AYU

In Problems 9-18, solve each linear programming problem.

Maximize $z=2x+y$ subject to $x\ge 0,y\ge 0,x+y\le 6,x+y\ge 1$

To determine

To solve: The given linear programming problem.

Answer to Problem 9AYU

Solution:

The maximum value of $z$ is 12, and it occurs at the point $\left(6,0\right)$.

Explanation of Solution

Given:

$\max z=2x+y$

Subject to

$x\ge 0$

$y\ge 0$

$x+y\le 6$

$x+y\ge 1$

Calculation:

The graph of this system (the set of feasible points) is shown as shaded region in figure below. The corner points have also been plotted.

The below table lists the corner points and the corresponding values of objective function.

Corner points are	Value of objective function
$\left(6,0\right)$	12
$\left(0,6\right)$	6
$\left(1,0\right)$	2
$\left(0,1\right)$	1

From the table, the maximum value of $z$ is 12, and it occurs at the point $\left(6,0\right)$.