Linear Programming (LP) is a key technique for Supply Chain Optimization. The PuLP framework is an easy to use tool for working with LP problems and allows the programmer to focus on modeling. In this chapter we learn the basics of LP problems and start to learn how to use the PuLP framework to solve them.
In this chapter we continue to learn how to model LP and IP problems in PuLP. We touch on how to use PuLP for large scale problems. Additionally, we begin our case study example on how to solve the Capacitated Plant location model.
This chapter reviews some common mistakes made when creating constraints, and step through the process of solving the model. Once we have a solution to our LP model, how do we know if it is correct? In this chapter we also review a process for reasonableness checking or sanity checking the results. Furthermore, we continue working through our case study example on the Capacitated Plant location model by completing all the needed constraints.
In our final chapter we review sensitivity analysis of constraints through shadow prices and slack. Additionally, we look at simulation testing our LP models. These different techniques allow us to answer different business-related questions about our models, such as available capacity and incremental costs. Finally, we complete our case study exercise and focus on using sensitivity analysis and simulation testing to answer questions about our model.