If you need an accessible version of this item please contact JSTOR User Support

An Algorithm for a Class of Discrete Maximum Entropy Problems

Dwight Freund and Umesh Saxena
Operations Research
Vol. 32, No. 1 (Jan. - Feb., 1984), pp. 210-215
Published by: INFORMS
Stable URL: http://www.jstor.org/stable/170529
Page Count: 6
  • Download PDF
  • Cite this Item

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If you need an accessible version of this item please contact JSTOR User Support
An Algorithm for a Class of Discrete Maximum Entropy Problems
Preview not available

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 (2n + 1) constraints. An example involving the selection of best equipment for an oil spill problem is presented.

Page Thumbnails

  • Thumbnail: Page 
210
    210
  • Thumbnail: Page 
211
    211
  • Thumbnail: Page 
212
    212
  • Thumbnail: Page 
213
    213
  • Thumbnail: Page 
214
    214
  • Thumbnail: Page 
215
    215