IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v33y1987i12p1593-1601.html
   My bibliography  Save this article

A Bicriteria Mathematical Programming Model for Nutrition Planning in Developing Nations

Author

Listed:
  • Harold P. Benson

    (University of Florida, Gainesville, Florida)

  • Thomas L. Morin

    (Krannert Graduate School, Purdue University, West Lafayette, Indiana 47907)

Abstract

Mathematical programming models for nutrition planning in developing nations typically involve the optimization of a single criterion function subject to resource and nutritional constraints. The nutritional constraints specify that the amount available of each nutrient for human consumption should meet or exceed some prechosen nutrient requirement level. However, fixed nutrient requirement levels are difficult to prespecify. In this paper, a bicriteria mathematical programming model is proposed which does not require planners to prespecify nutrient requirement levels for several key nutrients. Instead, the model generates an entire set of efficient nutrition plans which supply various amounts of these nutrients. To demonstrate the use and potential benefits of this model, an illustrative application to Colombia, South America is included.

Suggested Citation

  • Harold P. Benson & Thomas L. Morin, 1987. "A Bicriteria Mathematical Programming Model for Nutrition Planning in Developing Nations," Management Science, INFORMS, vol. 33(12), pages 1593-1601, December.
    • Handle: RePEc:inm:ormnsc:v:33:y:1987:i:12:p:1593-1601
    DOI: 10.1287/mnsc.33.12.1593
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.33.12.1593
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.33.12.1593?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
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Harold P. Benson & Serpil Sayin, 1997. "Towards finding global representations of the efficient set in multiple objective mathematical programming," Naval Research Logistics (NRL), John Wiley & Sons, vol. 44(1), pages 47-67, February.
    2. Yasemin Aksoy, 1990. "An interactive branch‐and‐bound algorithm for bicriterion nonconvex/mixed integer programming," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(3), pages 403-417, June.

    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:inm:ormnsc:v:33:y:1987:i:12:p:1593-1601. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.