Learning Paths
Each learning path is one chapter: a guided route through a topic, one small course at a time. Pick a class to see its chapters in order.
Chapter 19
Linear Programming, Linear Inequalities
A baker has 60 kg of flour and 40 kg of sugar. Cookies and cakes use them in different amounts and earn different profits. How many of each should she bake? Guessing is slow, and trying every plan is endless. Linear programming gives the best plan with a graph and a short list of corner points. In this chapter you draw inequalities, find the region of allowed plans, test its corners, and handle the cases with no best plan or many. Then you turn word problems on factories, diets and deliveries into a plan, and Python checks every answer.
3 courses
