

Semester Offering:  




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 circuitswitched and packetswitched networks, resource allocation in local area networks.




Consent of instructor.




I. Reviews of linear algebra and analysis
II. Convex optimization
III. Linear optimization
IV. Combinatorial optimization


Learning Resources:  


Lecture notes and handouts.




D.P. Bertsekas, Dynamic Programming and Optimal Control , Athena Scientific, 1995.




IEEE/ACM Transactions on Communications




The final grade will be computed from the following components:

