Abstract
This paper treats entropy constrained linear programs from modelling as well as computational aspects. The optimal solutions to linear programs with one additional entropy constraint are expressed in terms of Lagrange-multipliers. Conditions for uniqueness are given. Sensitivity and duality are studied. The Newton—Kantorovich method is used to obtain a locally convergent iterative procedure. Related problems based on maximum entropy or minimum information are discussed.
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.
