Geometry and Theory of LP Standard (Inequality) Primal Problem: Dual Problem:

Geometry of the Prototype Example P1 P2 0 Every point in this nonnegative quadrant is associated with a specific production alternative. ( point = decision = solution ) Max 3 P1 + 5 P2 s.t. P1 + < 4 (Plant 1) 2 P2 < 12 (Plant 2) 2 P2 < 12 (Plant 2) 3 P1 + 2 P2 < 18 (Plant 3) 3 P1 + 2 P2 < 18 (Plant 3) P1, P2 > 0 (nonnegativity) P1, P2 > 0 (nonnegativity)

Geometry of the Prototype Example P1 P2 (0,0) Max 3 P1 + 5 P2 s.t. P1 + < 4 (Plant 1) 2 P2 < 12 (Plant 2) 2 P2 < 12 (Plant 2) 3 P1 + 2 P2 < 18 (Plant 3) 3 P1 + 2 P2 < 18 (Plant 3) P1, P2 > 0 (nonnegativity) P1, P2 > 0 (nonnegativity) (4,0)

Geometry of the Prototype Example P1 P2 (0,0) Max 3 P1 + 5 P2 s.t. P1 + < 4 (Plant 1) 2 P2 < 12 (Plant 2) 2 P2 < 12 (Plant 2) 3 P1 + 2 P2 < 18 (Plant 3) 3 P1 + 2 P2 < 18 (Plant 3) P1, P2 > 0 (nonnegativity) P1, P2 > 0 (nonnegativity) (4,0) (0,6)

Geometry of the Prototype Example P1 P2 (0,0) Max 3 P1 + 5 P2 s.t. P1 + < 4 (Plant 1) 2 P2 < 12 (Plant 2) 2 P2 < 12 (Plant 2) 3 P1 + 2 P2 < 18 (Plant 3) 3 P1 + 2 P2 < 18 (Plant 3) P1, P2 > 0 (nonnegativity) P1, P2 > 0 (nonnegativity) (4,0) (0,6)(2,6) (4,3) (9,0)

Geometry of the Prototype Example P1 P2 (0,0) Max 3 P1 + 5 P2 s.t. P1 + < 4 (Plant 1) 2 P2 < 12 (Plant 2) 2 P2 < 12 (Plant 2) 3 P1 + 2 P2 < 18 (Plant 3) 3 P1 + 2 P2 < 18 (Plant 3) P1, P2 > 0 (nonnegativity) P1, P2 > 0 (nonnegativity) (4,0) (0,6)(2,6) (4,3) (9,0)

P1 P2 (0,0) Max 3 P1 + 5 P2 In Feasible Region (4,0) (0,6)(2,6) (4,3) (9,0) Feasible region is the set of points (solutions) that simultaneously satisfy all the constraints. There are infinitely many feasible points (solutions).

Geometry of the Prototype Example P1 P2 (0,0) Max 3 P1 + 5 P2 (4,0) (0,6)(2,6) (4,3) (9,0) Objective function contour (iso-profit line) 3 P1 + 5 P2 = 12

Geometry of the Prototype Example P1 P2 (0,0) Max 3 P1 + 5 P2 s.t. P1 + < 4 (Plant 1) 2 P2 < 12 (Plant 2) 2 P2 < 12 (Plant 2) 3 P1 + 2 P2 < 18 (Plant 3) 3 P1 + 2 P2 < 18 (Plant 3) P1, P2 > 0 (nonnegativity) P1, P2 > 0 (nonnegativity) (4,0) (0,6)(2,6) (4,3) (9,0) Optimal Solution: the solution for the simultaneous boundary equations of two active constraints 3 P1 + 5 P2 = 36

Degeneracy P1 P2 (0,0) Max 3 P1 + 5 P2 s.t. P1 + < 4 (Plant 1) 2 P2 < 12 (Plant 2) 2 P2 < 12 (Plant 2) 3 P1 + 2 P2 < 24 (Plant 3) 3 P1 + 2 P2 < 24 (Plant 3) P1, P2 > 0 (nonnegativity) P1, P2 > 0 (nonnegativity) (4,0) (0,6)(2,6) (9,0) The number of active constraints is more than the number of variables.

LP Terminology n n solution (decision, point): any specification of values for all decision variables, regardless of whether it is a desirable or even allowable choice n n feasible solution: a solution for which all the constraints are satisfied. n n feasible region (constraint set, feasible set): the collection of all feasible solution n n objective function contour (iso-profit, iso-cost line) n n optimal solution (optimum): a feasible solution that has the most favorable value of the objective function n n optimal (objective) value: the value of the objective function evaluated at an optimal solution n n active constraint (binding constraint) n n inactive constraint n n redundant constraint n n interior, boundary n n extreme point (corner)

Unbounded or Infeasible Case n On the left, the objective function is unbounded n On the right, the feasible set is empty

Graphical Solution Seeking n Plot the feasible region. n If the region is empty, stop: the problem is infeasible; there must be conflicting constraints in the model. n Plot the objective function contour and choose the optimizing direction. n Determine whether the objective value is bounded or not. If not, stop: the problem is unbounded; there must be mistakes in model formulation. n Determine an optimal corner point. n Identify active constraints at this corner. n Solve simultaneous linear equations for the optimal solution. n Evaluate the objective function at the optimal solution to obtain the optimal value of the problem.

Theory of Linear Programming An LP problem falls in one of three cases: n Problem is infeasible: Feasible region is empty. n Problem is unbounded: Feasible region is unbounded towards the optimizing direction. n Problem is feasible and bounded: then there exists an optimal point; an optimal point is on the boundary of the feasible region; and there is always at least one optimal corner point (if the feasible region has a corner point). When the problem is feasible and bounded, n There may be a unique optimal point or multiple optima (alternative optima). n If a corner point is not “worse” than all its neighbor corners, then it is optimal.

Convexity of Feasible Region Convex Set Non-Convex Set Convex Set Non-Convex Set F is a convex set if and only if for any two points, x and y, of F, their convex combination,  x + (1-  )y, for all real values 0 <=  <= 1, is also in F. F is a convex set if and only if for any two points, x and y, of F, their convex combination,  x + (1-  )y, for all real values 0 <=  <= 1, is also in F.

Local Optimal => Global Optimal Convex Set Convex Set Proof by contradiction: If the point is not globally optimal, then it is not locally optimal Proof by contradiction: If the point is not globally optimal, then it is not locally optimal

LP Duality Standard (Inequality) Primal Problem: Dual Problem:

LP Duality (continued) Standard (Equality) Primal Form: Dual Form:

Example: max 3x1 + 5x2 max 3x1 + 5x2s.t. x1 <= 4 x1 <= 4 2x2 <= 12 2x2 <= 12 3x1 + 2x2 <=18 x1, x2 >= 0 x1, x2 >= 0 min 4y1 + 12y2 + 18y3 min 4y1 + 12y2 + 18y3 s.t. s.t. y1 + 3y3 >= 3 y1 + 3y3 >= 3 2y2 + 2y3 >= 5 2y2 + 2y3 >= 5 y1, y2, y3 >= 0 y1, y2, y3 >= 0

General Rules for Constructing Dual 1. The number of variables in the dual problem is equal to the number of constraints in the original (primal) problem. The number of constraints in the dual problem is equal to the number of variables in the original problem. 2. Coefficient of the objective function in the dual problem come from the right- hand side of the original problem. 3. If the original problem is a max model, the dual is a min model; if the original problem is a min model, the dual problem is the max problem. 4. The coefficient of the first constraint function for the dual problem are the coefficients of the first variable in the constraints for the original problem, and the similarly for other constraints. 5. The right-hand sides of the dual constraints come from the objective function coefficients in the original problem.

General Rules for Constructing Dual ( Continued) 6. The sense of the ith constraint in the dual is = if and only if the ith variable in the original problem is unrestricted in sign. 7. If the original problem is man (min ) model, then after applying Rule 6, assign to the remaining constraints in the dual a sense the same as (opposite to ) the corresponding variables in the original problem. 8. The ith variable in the dual is unrestricted in sigh if and only if the ith constraint in the original problem is an equality. 9. If the original problem is max (min) model, then after applying Rule 8, assign to the remaining variables in the dual a sense opposite to (the same as) the corresponding constraints in the original problem. Max model Min model x i >= 0 ith constraint>= x i ith constraint ith constraint = ith const y i >= 0 ith const >= y i y i free

Economic Interpretation 1. Max Model: the shadow price for the ith constraint = the optimal value of the ith variable in the dual. 2. Min Model: the shadow price for the ith constraint = - the optimal value of the ith variable in the dual. 3. Suppose Factory 1’s production problem is Max3x1 + 5x2 s.t. x1 <= 4 s.t. x1 <= 4 2x2 <= 12 2x2 <= 12 3x1 + 2x2 <= 18 3x1 + 2x2 <= 18 x1, x2 >= 0 x1, x2 >= 0 Suppose that the management of Factory 2 decides to BUY the raw material in factory 1. What are ‘fair price’ for the three raw material? Amount Factory 2 pays = 4y1 + 12y2 + 18y3 Amount Factory 2 pays = 4y1 + 12y2 + 18y3 Of course, Factory 2 wants to pay as less as possible. Its goal is to Of course, Factory 2 wants to pay as less as possible. Its goal is to Min 4y1 + 12y2 + 18y3

Economic Interpretation ( continued ): However, the prices must satisfy Factory 1 such that Factory 1 is willing to sell. However, the prices must satisfy Factory 1 such that Factory 1 is willing to sell. Factory 1 sees that if it has 1 unit raw material 1 and 3 units of raw material 3, it Factory 1 sees that if it has 1 unit raw material 1 and 3 units of raw material 3, it could produce on unit product 1 for a profit $3. Thus, to satisfy Factory 1, could produce on unit product 1 for a profit $3. Thus, to satisfy Factory 1, Factory 2 will cover the loss of product 1 in Factory 1 due to the sell: Factory 2 will cover the loss of product 1 in Factory 1 due to the sell: y1 + 3y3 >= 3 The same is true for Product 2 in Factory 1: The same is true for Product 2 in Factory 1: 2y2 + 2y3 >=5 Finally, Factory 2 faces the optimal pricing problem Finally, Factory 2 faces the optimal pricing problem min 4y1 + 12y2 + 18y3 s.t. y1 + 3y3 >= 3 2y2 + 2y3 >= 5 2y2 + 2y3 >= 5 y1, y2, y3 >= 0 y1, y2, y3 >= 0 It provides ‘fair prices’ in the sense of prices that yield the minimum acceptable It provides ‘fair prices’ in the sense of prices that yield the minimum acceptable liquidation payment. liquidation payment.

Relations between Primal and Dual 1. The dual of the dual problem is again the primal problem. 2. Either of the two problems has an optimal solution if and only if the other does; if one problem is feasible but unbounded, then the other is infeasible; if one is infeasible, then the other is either infeasible or feasible/unbounded Weak Duality Theorem: The objective function value of the primal (dual) to be maximized evaluated at any primal (dual) feasible solution cannot exceed the dual (primal) objective function value evaluated at a dual (primal) feasible solution. c T x >= b T y (in the standard equality form)

Relations between Primal and Dual (continued) Strong Duality Theorem: When there is an optimal solution, the optimal objective value of the primal is the same as the optimal objective value of the dual. c T x* = b T y* 5. Complementary Slackness Theorem: 5. Complementary Slackness Theorem: Consider an inequality constraint in any LP problem. If that constraint is inactive for an optimal solution to the problem, the corresponding dual variable will be zero in any optimal solution to the dual of that problem. x* j (c-A T y*) j = 0, j=1,…,n.

Optimality Conditions Primal Feasibility: Dual Feasibility: Strong Duality: Strong Duality: or Complementary Slackness:

States of the LP Problems DualPrimal Have an Opt. SolutionUnboundedInfeasible Solution Unbounded Infeasible