Heuristics

Abstract

This chapter introduces heuristics and mathematical optimization. It introduces the framework to formulate an optimization process. Next, it introduces linear programming, mixed-integer programming, and constraint programming techniques. To run the optimization code, the chapter introduces several types of solvers and compares the solvers. The chapter salutes and sincerely thanks George Dantzig for creating trillions of dollars of value and saving countless years of life across the globe through the power of optimization. This chapter showcases two industrial use cases: manufacturing general assembly line balancing and surgical suture management. Finally, the chapter concludes with model and simulation process and choosing solver technology.