IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v32y1984i1p210-215.html
   My bibliography  Save this article

Technical Note—An Algorithm for a Class of Discrete Maximum Entropy Problems

Author

Listed:
  • Dwight Freund

    (University of Wisconsin, Waukesha, Wisconsin)

  • Umesh Saxena

    (University of Wisconsin, Milwaukee, Wisconsin)

Abstract

This note presents an exact method for solving a class of maximum entropy problems used in a decision making context. These exact solutions should prove valuable for benchmark testing of the numerical nonlinear programming methods normally applied to a large class of problems that includes those studied here. The finite algorithm developed has a complexity of order O ( n ) for a problem with (2 n + 1) constraints. An example involving the selection of best equipment for an oil spill problem is presented.

Suggested Citation

  • Dwight Freund & Umesh Saxena, 1984. "Technical Note—An Algorithm for a Class of Discrete Maximum Entropy Problems," Operations Research, INFORMS, vol. 32(1), pages 210-215, February.
    • Handle: RePEc:inm:oropre:v:32:y:1984:i:1:p:210-215
    DOI: 10.1287/opre.32.1.210
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.32.1.210
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.32.1.210?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. A Nagurney & Referee H K Chen, 1989. "An Algorithm for the Solution of a Quadratic Programming Problem, with Application to Constrained Matrix and Spatial Price Equilibrium Problems," Environment and Planning A, , vol. 21(1), pages 99-114, January.

    More about this item

    Keywords

    91 decision analysis; 566 entropy;

    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:inm:oropre:v:32:y:1984:i:1:p:210-215. 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.