Computational Study of Cutting Planes for a Lot-Sizing Problem in Branch-and-Cut Algorithm
Branch-and-Cut 알고리즘에서 Lot-Sizing 문제에 대한 Cutting Planes의 전산 성능 연구

Kwanghun Chung
2015 Journal of the Korean Operations Research and Management Science Society  
In this paper, we evaluate the strength of three families of cutting planes for a lot-sizing problem. Lot-sizing problem is very basic MIP model for production planning and many strong valid inequalities have been developed for a variety of relaxations in the literature. To use three families of cutting planes in Branch-and-Cut framework, we develop separation algorithms for each cut and implement them in CPLEX. Then, we perform computational study to compare the effectiveness of three cuts for
more » ... randomly generated instances of the lot-sizing problem.
doi:10.7737/jkorms.2015.40.3.023 fatcat:thqc7ilqs5berd564s74wmd24y