An ϵ-Out-of-Kilter Method for Monotropic Programming

References

• Ahuja R. K., Magnanti T. L., Orlin J. B.Network Flows (1993) (Prentice-Hall, Englewood Cliffs) Google Scholar
• Ahuja R. K., Magnanti T. L., Orlin J. B., Reddy M. R., Ball M. O., Magnanti T. L., Monma C. L., Nemhauser G. L. Applications of network optimization. Network Models (1995) (North-Holland, Amsterdam, The Netherlands) 1–83Crossref, Google Scholar
• Bertsekas D. P.Linear Network Optimization: Algorithms and Codes (1991) (MIT Press, Cambridge, MA) Google Scholar
• Bertsekas D. P.Network Optimization: Continuous and Discrete Models (1998) (Athena Scientific, Belmont, MA) Google Scholar
• Bertsekas D. P., Hosein P. A., Tseng P. Relaxation methods for network flow problems with convex arc costs. SIAM J. Control Optim. (1987) 25:1219–1243Crossref, Google Scholar
• Bertsekas D. P., Polymenakos L. C., Tseng P. An ε-relaxation method for separable convex cost network flow problems. SIAM J. Optim. (1997a) 7:853–870Crossref, Google Scholar
• Bertsekas D. P., Polymenakos L. C., Tseng P., Pardalos P. M., Hearn D. W., Hager W. W. ε-relaxation and auction methods for separable convex cost network flow problems. Network Optimization: Lecture Notes in Economics and Mathematical Systems 450 (1997b) (Springer-Verlag, Berlin, Germany) 103–126Crossref, Google Scholar
• Dantzig G. B., Wolfe P. Decomposition principle for linear programs. Oper. Res. (1960) 8:101–111Link, Google Scholar
• De Leone R., Meyer R. R., Zakarian A. A partitioned ε-relaxation algorithm for separable convex network flow problems. Comput. Optim. Appl. (1999) 12:107–126Crossref, Google Scholar
• Dembo R. S., Mulvey J. M., Zenios S. A. Large-scale nonlinear network models and their application. Oper. Res. (1989) 37:353–372Link, Google Scholar
• Edmonds J., Karp R. M. Theoretical improvements in algorithmic efficiency for max flow problems. J. Assoc. Comput. Mach. (1972) 19:248–264Crossref, Google Scholar
• Ford L. R., Fulkerson D. R.Flows in Networks (1962) (Princeton University Press, Princeton, NJ) Crossref, Google Scholar
• Fulkerson D. R. An out-of-kilter method for minimal cost flow problems. SIAM J. Math. (1961) 9:18–27Crossref, Google Scholar
• Gonzaga C. Path-following methods in linear programming. SIAM Rev. (1992) 34:167–224Crossref, Google Scholar
• Minty G. J. Solving steady-state nonlinear networks of “monotone” elements. IRE Trans. Circuit Theory (1961) CT-8:99–104Crossref, Google Scholar
• Rockafellar R. T.Convex Analysis (1970) (Princeton University Press, Princeton, NJ) Crossref, Google Scholar
• Rockafellar R. T.Network Flows and Monotropic Programming (1984) (Wiley-Interscience, New York) Google Scholar
• Tseng P., Bertsekas D. P. Relaxation methods for monotropic programs. Math. Programming (1990) 46:127–151Crossref, Google Scholar
• Tseng P. An ε-relaxation method for separable convex cost generalized network flow problems. Math. Programming (2000) 88:85–104Crossref, Google Scholar