Abstract
A particularly convenient mathematical formulation for the modelling of a wide range of problems associated with operations research is a linearly constrained convex mathematical program. The paper analyses such a formulation using the notions of conjugate function theory. The aims of the analysis are easier computational possibilities and an enhanced understanding of the problem. To this end the duality theory of generalized geometric programming is specifically invoked. Application of this approach is made to three representative application areas: networks, resource allocation and entropy modelling.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
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
