Linear Programming Example: Maximize x + y x and y are called Subject to: x + 2y  90 2x + y  60 x  0 y  0 x and y are called Control variables x + y is called the Objective function The inequalities are constraints It is called Linear programming as the functions Are linear (not quadratic etc.)

Linear Programming Example: Maximize x + y x and y are called Subject to: x + 2y  90 2x + y  60 x  0 y  0 x and y are called Control variables x + y is called the Objective function The inequalities are constraints It is called Linear programming as the functions are linear (not quadratic etc.) y Try x + y = a, and reduce a from a large number 2x + y = 60 Feasible region x + 2y = 90 x = 0 y = 0 x