A COMPUTATIONAL COMPARISON OF LINEAR OPTIMIZATION SOLVERS IN PYTHON FOR AGGREGATE PRODUCTION PLANNING MODELS

Authors

  • Waheed Ahmad Khan
  • Aamir Shahzad
  • Sana Shabbir
  • Sidra Ashraf
  • Hassan Raza

Keywords:

Aggregate Production Planning, Productivity, Python PuLP, Python SciPy, Python CVXPY, Optimization

Abstract

Aggregate Production Planning (APP) plays a dynamic role in leveling production rates, manpower levels, and inventory over a planning scope based on demand prediction. This paper investigates a comparative analysis of three open-source Python solvers PuLP(using the CBC solver), SciPy(using the linprog method), and CVXPY(using the SCS solver) to solve the APP problem under a fixed workforce model in textile industry. Instead of introducing productivity loss as in some earlier models, this research keep constant workforce levels to simplify manpower-related cost and to emphasize solver efficiency. The first goal is to measure the computational efficiency, solution accuracy, and utility of each solver when applied to the same linear programming(LP) formulation of the APP problem. On a constant data set, all solvers are tested to assure fairness in comparison. The results highlight the capability and limitations of each solver, offering valuable modality for researchers and professionals intent to select proper tools for production planning project using Python-based optimization.

Downloads

Published

2026-02-25

How to Cite

Waheed Ahmad Khan, Aamir Shahzad, Sana Shabbir, Sidra Ashraf, & Hassan Raza. (2026). A COMPUTATIONAL COMPARISON OF LINEAR OPTIMIZATION SOLVERS IN PYTHON FOR AGGREGATE PRODUCTION PLANNING MODELS. Spectrum of Engineering Sciences, 4(2), 512–525. Retrieved from https://www.thesesjournal.com/index.php/1/article/view/2086