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

No credit card required

Appendix BMathematical Optimization Basics

B.1 Optimization Problems

A mathematical optimization problem, or just an optimization problem, consists of finding a vector that minimizes an objective function , searching only among a set of solutions that satisfy given constraints:

B.1a B.1b B.1c B.1d where are the problem decision variables1. In network optimization problems, they typically represent quantities like “capacity in a link”, “traffic to be carried through a path”, or “number of links between two nodes”. Function is called the problem objective function, (B.1b) are the equality constraints, (B.1c) the inequality constraints, and (B.1d) the set constraints.

A solution which satisfies ...

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

No credit card required