Question

In Exercises 3 and 4 solve the given integer programming problem by the cutting plane method and sketch the graph of the set of feasible solutions and the cutting planes. 3. Maximize $z = x + y$ subject to 4. Maximize $z = x + 4y$ subject to $2x + 3y \le 12$ $2x + y \le 6$ $x \ge 0$, $y \ge 0$, integers. $x + 6y \le 36$ $3x + 8y \le 60$ $x \ge 0$, $y \ge 0$, integers. In Exercises 5-12 solve the given integer programming problem using the cutting plane algorithm. 5. Maximize $z = 4x + y$ subject to $3x + 2y \le 5$ $2x + 6y \le 7$ $3x + 7y \le 6$ $x \ge 0$, $y \ge 0$, integers.

          In Exercises 3 and 4 solve the given integer programming problem by the
cutting plane method and sketch the graph of the set of feasible solutions and the
cutting planes.
3. Maximize $z = x + y$
subject to
4. Maximize $z = x + 4y$
subject to
$2x + 3y \le 12$
$2x + y \le 6$
$x \ge 0$, $y \ge 0$, integers.
$x + 6y \le 36$
$3x + 8y \le 60$
$x \ge 0$, $y \ge 0$, integers.
In Exercises 5-12 solve the given integer programming problem using the
cutting plane algorithm.
5. Maximize $z = 4x + y$
subject to
$3x + 2y \le 5$
$2x + 6y \le 7$
$3x + 7y \le 6$
$x \ge 0$, $y \ge 0$, integers.

In Exercises 3 and 4 solve the given integer programming problem by the
cutting plane method and sketch the graph of the set of feasible solutions and the
cutting planes.
3. Maximize z = x + y
subject to
4. Maximize z = x + 4y
subject to
2x + 3y ≤ 12
2x + y ≤ 6
x ≥ 0, y ≥ 0, integers.
x + 6y ≤ 36
3x + 8y ≤ 60
x ≥ 0, y ≥ 0, integers.
In Exercises 5-12 solve the given integer programming problem using the
cutting plane algorithm.
5. Maximize z = 4x + y
subject to
3x + 2y ≤ 5
2x + 6y ≤ 7
3x + 7y ≤ 6
x ≥ 0, y ≥ 0, integers.

Added by Amy T.

Question

Please give Ace some feedback