Abstract
The paper explores the use of the Shannon (informational) entropy measure and Jaynes's maximum entropy formalism in the solution of constrained non-linear programming problems. Through a surrogate constraint approach an entropy based update formula for the surrogate multipliers is derived. A numerical example of the method is presented. Some information-theoretic interpretations of mathematical programming are explored. Finally, through the use or surrogate duals the method is extended into an entropy augmented Lagrangean formulation.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
