Semester Offering: August

To provide students with the fundamentals of various optimization techniques and demonstrate how they can be applied to problems related to communications and networks.


Convex optimization, linear optimization, combinatorial optimization. Network topology design, traffic routing in circuit-switched and packet-switched networks, resource allocation in local area networks.


Consent of instructor.


I. Reviews of linear algebra and analysis

II. Convex optimization

  1. Lagrange multiplier and duality theory
  2. Lagrange multiplier method
  3. Sensitivity analysis
  4. Application: routing in packet-switched networks
  5. Application: power allocation in local area networks

III. Linear optimization

  1. Simplex method
  2. Duality theory for linear optimization
  3. Sensitivity analysis
  4. Application: routing in circuit-switched networks
  5. Application: routing in wireless sensor networks

IV. Combinatorial optimization

  1. Integer programming
  2. Exact solutions
  3. Heuristic solutions
  4. Application: physical topology design for communication networks
  5. Application: routing and wavelength assignment in optical networks


Lecture notes and handouts.


D.P. Bertsekas, Dynamic Programming and Optimal Control , Athena Scientific, 1995.
D.P. Bertsekas, Nonlinear Programming , Athena Scientific, 1995.
D.P. Bertsekas and R.G. Gallager, Data Networks , Athena Scientific, 1992.
D. Bertsimas and J.N. Tsitsiklis, Introduction to Linear Optimization , Athena Scientific, 1997.
S. Boyd and L. Vandenberghe, Convex Optimization , Cambridge University Press, 2004.
T.H. Cormen, C.E. Leiserson, and R.L. Rivest, Introduction to Algorithms . McGraw-Hill, 1990.
P. Kall and S.W. Wallace, Stochastic Programming , Wiley, 1995.
C.H. Papadimitriou and K. Steiglitz Combinatorial Optimization , Dover Publications, 1998.


IEEE/ACM Transactions on Communications
IEEE Transactions on Communications
Proceedings of the IEEE
IEEE Journal on Selected Areas in Communications
IEICE Transactions


The final grade will be computed from the following components:
assignments (30 %),
mid-semester exam (30%),
and final exam (40%).
Closed-book examination is used in both mid-semester and final exams.