C. Duality and Sensitivity Analysis in Linear Programming
This appendix is a continuation of the subject of linear programming (LP). The topics covered in this appendix are duality and sensitivity analysis in linear programing models. These methods are of value in the third step of the BA process: prescriptive analytics.
C.2 What Is Duality?
Solving an LP problem as in Appendix B, “Linear Programming,” involves solving for the optimal value for Z, Xj, and si. This is known as a primal problem, because an optimal solution is being sought that explains the primary or primal relationship between the Xj and si variables, values as they consume right side bi constant parameters. Embedded within this primal solution is a dual solution ...