Skip to Main Content
Linear Programming and Algorithms for Communication Networks
book

Linear Programming and Algorithms for Communication Networks

by Eiji Oki
August 2012
Intermediate to advanced content levelIntermediate to advanced
208 pages
4h 34m
English
CRC Press
Content preview from 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 + 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 ...

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Algorithms For Dummies

Algorithms For Dummies

John Paul Mueller, Luca Massaron

Publisher Resources

ISBN: 9781466552647