What you will learn in Linear Programming & Optimisation

1. 1. From Situation to Constraints

   The part that is actually hard, done before there is a graph to hide behind.

2. 2. The Feasible Region

   Half-planes intersected, with the corners solved for rather than read off.

3. 3. The Objective Function and Iso-Profit Lines

   One line, slid across the region, and where it was last touching.

4. 4. The Corner-Point Method

   The ten per cent: list the corners, evaluate, pick the best.

5. 5. Bounded and Unbounded Regions

   When a region that runs off to infinity still has an answer — and when it does not.

6. 6. Multiple Optima and Infeasibility

   Two answers that look like failures and are not.

7. 7. Sensitivity and Slack

   Which resource ran out, what spare capacity is worth, and what changes the answer.

8. 8. Beyond Two Variables: the Simplex Idea

   Walking the corners, because listing them stops being possible.

9. 9. Transport and Assignment Problems

   Structured problems that are too big to draw and tractable anyway.

10. 10. A Full Case Study

    One scenario from brief to recommendation — and the sentence is the deliverable.