Abstract
Duality schemes have been developed for almost all types of optimization problems, but the classical scheme in linear programming has remained the most popular and indeed the only one that is widely familiar. No doubt this is due its simplicity and ease of application as much as its close connection with computation, which is a property shared with other dualities.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
R.T. Rockafellar, Network Flows and Monotropic Optimization, Wiley-Inter-science, 1984.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rockafellar, R.T. (1985). Monotropic Programming: A Generalization of Linear Programming and Network Programming. In: Ponstein, J. (eds) Convexity and Duality in Optimization. Lecture Notes in Economics and Mathematical Systems, vol 256. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-45610-7_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-45610-7_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15986-5
Online ISBN: 978-3-642-45610-7
eBook Packages: Springer Book Archive