Appendix B
Derivation of Eqs. (7.12a)–(7.12c) for HSDT model
Eqs. (7.11a)–(7.11d), which is the LP problem of finding T = {tpq} that maximizes link load on (i, j), is represented with a matrix expression by
where
N is the number of nodes. t is an NN × 1 matrix. Xij is an NN × 1 matrix. A is a (2N + 2NN) × NN matrix. C is a (2N + 2NN) × 1 matrix.
The dual of the LP problem represented by Eqs. (B.1a)–(B.2d) for(i, j) is
where
zij is a (2N + 2NN) ...
Get Linear Programming and Algorithms for Communication Networks now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
