​CSCI 5654: Linear Programming

Instructor Fall 2016: Sriram Sankaranarayanan

Prerequisites

Calculus I,II + Algorithms + Linear Algebra.

Topics Covered

Roughly, we will cover the following topics (some of them may be skipped depending on the time available).

  • Linear Programming: Basics, Simplex Algorithm, and Duality.

  • Applications of Linear Programming: regression, classification and other engineering applications.

  • Integer Linear Programming: Basics, Branch-and-Bound, Cutting Plane Methods.

  • Combinatorial Optimization: Basics of approximation algorithms.

  • Network flow problems.

  • Interior point methods.

  • ID

    DateTopics CoveredBook Sections
    1Aug 22Introduction to OptimizationNot from Book
    2Aug 24Linear Programming Problems and Examples.ch. 1
    3Aug 26Simplex method: basicsch. 2
    4Aug 29Simplex algorithm: pivoting and termination.ch. 2
    5Aug 31Initialization and termination of Simplexch. 2
    6Sep 2Degeneracy and degenerate dictionariesch. 3
    7Sep 5Cycling and Bland's rulech. 3
    8Sep 7Geometry of Simplexch. 2 & 3
    9Sep 9Correctness & Complexitych. 3
    10Sep 12Duality theorych. 5
    11Sep 14Properties of the dual problemc h. 5
    12Sep 16Dual Simplex and Initializationch . 5
    13Sep 19Simplex algorithm in matrix formch. 6
    14Sep 21Revised Simplex methodch. 8
    15Sep 23Factored form of the basisch. 8
    16Sep 26Sensitivity analysisch. 7
    17Sep 28wrap up of Simplex and dualityÌý
    18Sep 30Regression: norms and their propertiesch. 12
    19Oct. 3Regression and classification problemsch. 12
    20Oct. 5Financial portfolio selectionch. 13
    21Oct. 7Options, derivatives and pricingch. 13
    22Oct. 10Tentative Date for Midterm upto sep. 30 lecture
    23Oct. 12Integer Linear ProgrammingSee Slides
    24Oct. 14Branch-and-bound methodSlides
    25Oct. 17Cutting Plane MethodSlides
    26Oct. 19Wrap up of ILP methodsÌý
    27Oct. 21Travelling Salesperson ProblemÌý
    29Oct. 24Approximation AlgorithmsÌý
    30Oct. 26Interior Point Methodsch. 17
    31Oct. 28Newton Methodch. 18
    32Nov. 2Convergence Analysisch. 18

Textbook

We will primarily use the textbook by Robert Vanderbei.

Robert J. Vanderbei. Linear Programming: Foundations and Extensions, 4th Edition.

(Available online through CU libraries for all CU students).

Ìý