IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v37y1990i4p579-586.html
   My bibliography  Save this article

Solving production smoothing problems with a nonlinear candidate constraint method

Author

Listed:
  • Jonathan D. Stanley
  • Awanti P. Sethi

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.

Suggested Citation

  • Jonathan D. Stanley & Awanti P. Sethi, 1990. "Solving production smoothing problems with a nonlinear candidate constraint method," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(4), pages 579-586, August.
    • Handle: RePEc:wly:navres:v:37:y:1990:i:4:p:579-586
    DOI: 10.1002/1520-6750(199008)37:43.0.CO;2-S
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/1520-6750(199008)37:43.0.CO;2-S
    Download Restriction: no
    File URL: https://libkey.io/10.1002/1520-6750(199008)37:43.0.CO;2-S?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Jay E. Aronson & Thomas E. Morton & Gerald L. Thompson, 1985. "A Forward Simplex Method for Staircase Linear Programs," Management Science, INFORMS, vol. 31(6), pages 664-679, June.
    2. Stanley, Jonathan D., 1987. "A forward convex-simplex method," European Journal of Operational Research, Elsevier, vol. 29(3), pages 328-335, June.
    3. Aronson, Jay E. & Morton, Thomas E. & Thompson, Gerald L., 1984. "A forward algorithm and planning horizon procedure for the production smoothing problem without inventory," European Journal of Operational Research, Elsevier, vol. 15(3), pages 348-365, March.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Suresh Chand & Vernon Ning Hsu & Suresh Sethi, 2002. "Forecast, Solution, and Rolling Horizons in Operations Management Problems: A Classified Bibliography," Manufacturing & Service Operations Management, INFORMS, vol. 4(1), pages 25-43, September.
    2. Milind Dawande & Srinagesh Gavirneni & Sanjeewa Naranpanawe & Suresh Sethi, 2007. "Forecast Horizons for a Class of Dynamic Lot-Size Problems Under Discrete Future Demand," Operations Research, INFORMS, vol. 55(4), pages 688-702, August.
    3. Cheryl Gaimon, 1994. "Subcontracting versus capacity expansion and the impact on pricing of services," Naval Research Logistics (NRL), John Wiley & Sons, vol. 41(7), pages 875-892, December.
    4. Dobos, Imre, 1996. "Aggregate planning with continuous time," International Journal of Production Economics, Elsevier, vol. 43(1), pages 1-9, May.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wly:navres:v:37:y:1990:i:4:p:579-586. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.