Proposal of a numerical approximation theory to solve the robust convex problem of production planning
by Marcelo Carneiro Gonçalves; Rafael Rodrigues Guimarães Wollmann; Raimundo José Borges De Sampaio
International Journal of Operational Research (IJOR), Vol. 52, No. 2, 2025

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.

Online publication date: Fri, 07-Feb-2025

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com