Solving production smoothing problems with a nonlinear candidate constraint method

Jonathan D. Stanley and Awanti P. Sethi

Naval Research Logistics (NRL), 1990, vol. 37, issue 4, 579-586

Abstract: We solve multiperiod nonlinear production smoothing problems by combining the convex simplex method due to Zangwill and the candidate constraint method of Sethi and Thompson. We show that, for the solved problems of size up to 120 constraints and 84 variables, computational savings of 50 percent to 60 percent over the convex simplex method can be realized by combining it with the candidate constraint method. The saving is mainly due to the reduction in the effective size of the problem and in the number of iterations performed. The method is also shown to be applicable to a wide range of problems besides production smoothing.

Date: 1990
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/1520-6750(199008)37:43.0.CO;2-S

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:wly:navres:v:37:y:1990:i:4:p:579-586

Access Statistics for this article

More articles in Naval Research Logistics (NRL) from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().