Linear Programming and Algorithms for Communication Networks

Answers to exercises

Answer 2.1

Figure D.1 shows the feasible region and the optimum solution. Let z be the objective function z = 8x1 + 6x₂. We want to maximize objective function z. We rewrite this function as x₂ = . The slope of this function is –, and it intersects the x₂-axis at (0, z). If we move this function up along the x₂-axis while keeping its slope, z increases. On the other hand, if we move it down along the x₂-axis, z decreases. As shown in Figure D.1, the maximum value of z is determined by moving the objective function up along the ...