Abstract
There are several programming languages that can be used for solving the models presented in the previous chapter. For single objective optimization models such as BM1 and BM2, we use the Pulp optimzer in Python; for the sustainable aggregate planning problem, a scalarization technique is implemented in Python to generate a large number of non-dominated points.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Ehrgott M (2005) Multicriteria optimization, vol 491. Springer, Berlin
Fattahi A, Türkay M (2018) A one direction search method to find the exact nondominated frontier of biobjective mixed-binary linear programming problems. Eur J Oper Res 266:415–425
Rasmi SAB, Türkay M (2019) Gondef: an exact method to generate all non-dominated points of multi-objective mixed-integer linear programs. Optim Eng 20(1):89–117
Rasmi SAB, Fattahi A, Türkay M (2021) SASS: slicing with adaptive steps search method for finding the non-dominated points of tri-objective mixed-integer linear programming problems. Ann Oper Res 296:841–876
Rasmi SAB, Kazan C, Türkay M (2019) A multi-criteria decision analysis to include environmental, social, and cultural issues in the sustainable aggregate production plans. Comput Ind Eng 132:348–360
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2021 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this chapter
Cite this chapter
Rasmi, S.A.B., Türkay, M. (2021). Solution Methods for Aggregate Planning Problems Using Python. In: Aggregate Planning. SpringerBriefs in Operations Research. Springer, Cham. https://doi.org/10.1007/978-3-030-58118-3_3
Download citation
DOI: https://doi.org/10.1007/978-3-030-58118-3_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-58117-6
Online ISBN: 978-3-030-58118-3
eBook Packages: Business and ManagementBusiness and Management (R0)