O'Reilly logo

Linear Programming and Algorithms for Communication Networks by Eiji Oki

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

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 + 6x2. We want to maximize objective function z. We rewrite this function as x2 = . The slope of this function is –, and it intersects the x2-axis at (0, z). If we move this function up along the x2-axis while keeping its slope, z increases. On the other hand, if we move it down along the x2-axis, z decreases. As shown in Figure D.1, the maximum value of z is determined by moving the objective function up along the ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required