Skip to main content

Solution Methods for Aggregate Planning Problems Using Python

  • Chapter
  • First Online:
Aggregate Planning

Part of the book series: SpringerBriefs in Operations Research ((BRIEFSOPERAT))

  • 660 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 16.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Ehrgott M (2005) Multicriteria optimization, vol 491. Springer, Berlin

    Google Scholar 

  2. 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

    Article  Google Scholar 

  3. 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

    Article  Google Scholar 

  4. 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

    Google Scholar 

  5. 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

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2021 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

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

Publish with us

Policies and ethics