Chapter 1: Introduction. An introduction to the process of optimization and an overview of the major topics covered in the course. Last revision: December 2020.

Chapter 2: Introduction to Linear Programming. The basic notions of linear programming and the simplex method. The simplex method is the easiest way to provide a beginner with a solid understanding of linear programming. Last revision: December 2020.

See animation LP1.

A good article on formulating LPs by Gerry Brown and Rob Dell.

Example questions with solutions. March 4, 2021.

Chapter 3: Towards the Simplex Method for Efficient Solution of Linear Programs. Cornerpoints and bases. Moving to improved solutions. Last revision: December 2020.

See animation LP2.

Chapter 4: The Mechanics of the Simplex Method. The tableau representation as a way of illustrating the process of the simplex method. Special cases such as degeneracy and unboundedness. Last revision: December 2020.

See animation LP3.

Example questions with solutions. March 5, 2021.

Chapter 5: Solving General Linear Programs. Solving non-standard linear programs. Phase 1 LPs. Feasibility and infeasibility. Unrestricted variables. Last revision: December 2020.

Example questions with solutions: simplex tableau for non-standard LPs. March 9, 2021.

Example questions with solutions: larger LPs to solve via computer. See the resources page to find pointers to free solvers. March 10, 2021.

Chapter 6: Sensitivity Analysis. Simple computer-based sensitivity analysis. Last revision: December 2020.

See animation LP6.

Example questions with solutions. March 15, 2021.

Chapter 7: Linear Programming in Practice. Mention of other solution methods such as revised simplex method and interior point methods. Mention of advanced techniques used in practice such as advanced and crash start methods, infeasibility analysis, and modelling systems. Last revision: December 2020.

Chapter 8: An Introduction to Networks. Some basic network concepts. The shortest route problem. The minimum spanning tree problem. Last revision: December 2020.

See animations Networks1 (Dijkstra's shortest route algorithm) and Networks2 (minimum spanning tree algorithm).

Example questions with solutions. March 16, 2021.

Chapter 9: Maximum Flow and Minimum Cut. The maximum flow and minimum cut problems in networks. Last revision: December 2020.

See animation Networks3.

Example question with solution. March 19, 2021.

Chapter 10: Network Flow Programming. A surprising range of problems can be solved using minimum cost network flow programming, including shortest route, maximum flow and minimum cut, etc. Variations such as generalized and processing networks are also briefly introduced. Last revision: December 2020.

- Example questions with solutions. March 22, 2021.

Chapter 11: PERT for Project Planning and Scheduling. PERT is a network-based aid for project planning and scheduling. Many optimization problems involve some aspect of the timing of activities that may run sequentially or in parallel, or the timing of resource use. PERT diagrams help you to understand and formulate such problems. Last revision: December 2020.

See animation Networks4.

Example questions with solutions. March 29, 2021.

Chapter 12: Integer/Discrete Programming via Branch and Bound. Branch and bound is the basic workhorse method for solving many kinds of problems that have variables that can take on only integer, binary, or discrete values. Last revision: December 2020.

See animation IP1.

Example question with solution. April 2, 2021.

Chapter 13: Binary and Mixed-Integer Programming. These are specialized versions of branch and bound. A binary program has only binary variables (0 or 1 only). A mixed-integer program looks like a linear program, except that some or all of the variables are integer-valued (or binary-valued), while others might be real-valued. Last revision: December 2020.

Example questions with solutions. April 7, 2021.

Chapter 14: Heuristics for Discrete Search: Genetic Algorithms and Simulated Annealing. Some problems are just too big for branch and bound, in which case you must abandon the guarantee of finding the optimum solution and instead opt for heuristic methods which can only guarantee to do fairly well most of the time. Genetic Algorithms and Simulated Annealing are two popular heuristic methods for use on very large problems. Last revision: December 2020.

See animations Heuristics1 (genetic algorithm) and Heuristics2 (simulated annealing).

Example question with solution. April 15, 2021.

Chapter 15: Dynamic Programming. This optimization technique builds towards a solution by first solving a small part of the whole problem, and then gradually incrementing the size in a series of stages until the whole problem is solved. Efficiency results from combining the local solution for a stage with the optimum found for a previous stage. We look at the simplest deterministic discrete cases. Last revision: December 2020.

See animation DP1.

Example questions with solutions. April 19, 2021.

Chapter 16: Introduction to Nonlinear Programming (NLP). NLP is a *lot* harder than linear programming. We start by looking at the reasons for this. Next we look at the simplest method for solving the simplest type of NLP: unconstrained problems that consist only of a nonlinear objective function. The method of steepest ascent/descent is described. Last revision: December 2020.

Chapter 17: Pattern Search for Unconstrained NLP. What do you do if you don’t have access to gradient information? In that case you can use pattern search techniques (also known as derivative-free, direct search, or black box methods). We look at the classic Hooke and Jeeves pattern search method. Last revision: December 2020.

See animation NLP7.

Chapter 18: Constrained Nonlinear Programming. Now that we have some idea of how to solve unconstrained NLPs, how do we deal with constrained NLPs? The first idea is to turn them into unconstrained NLPs of course! This is done by using penalty and barrier methods which replace or modify the original objective function in ways that make feasible points attractive in the resulting unconstrained problem. Last revision: December 2020.

Chapter 19: Handling Equality Constraints in NLP. Equality constraints are the hardest to handle in nonlinear programming. We look at two ways of dealing with them: (i) the method of Lagrange, and (ii) the Generalized Reduced Gradient (GRG) method. And we take a look at making linear approximations to nonlinear functions because we need that for the GRG method. Last revision: December 2020.

Different nonlinear local solvers can give quite different

*solution trajectories*, i.e. the sequence of intermediate solutions reached before the final solution. You can see this in the next few animations: NLP3, NLP4, NLP5

### Notes

- Algorithm animations may not show on some phones unless you switch to "web view".
- Direct any feedback to chinneck@sce.carleton.ca.

### Acknowledgements

- Kelly Kinahan
- Jennifer Pryor
- Hasan Issa