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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
