Proposal of a numerical approximation theory to solve the robust convex problem of production planning

Marcelo Carneiro Gonçalves, Rafael Rodrigues Guimarães Wollmann and Raimundo José Borges De Sampaio

International Journal of Operational Research, 2025, vol. 52, issue 2, 171-191

Abstract: This research seeks to solve the production planning problem modelled as a queuing system to propose to managers a production planning model that uses efficient, simple and robust methods. First, a robust mathematical model of nonlinear programming was proposed considering the concepts of queuing systems to estimate production capacity. Next, this model was approximated by a family of affine functions using the strategy of approximating a convex set by a polyhedral set. Finally, a theorem was proposed to demonstrate that a robust nonlinear programming model can be approximated by a robust linear programming model. From a numerical experiment with data from an electronic equipment company, it was possible to observe the effectiveness of the approximation method.

Keywords: robust optimisation; linear programming; convex programming; queuing systems. (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=144318 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:52:y:2025:i:2:p:171-191

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().