Skip to main content
Log in

Duality for extended infinite monotropic optimization problems

  • Full Length Paper
  • Series B
  • Published:
Mathematical Programming Submit manuscript

Abstract

We establish necessary and sufficient conditions for strong duality of extended monotropic optimization problems with possibly infinite sum of separable functions. The results are applied to a minimization problem of the infinite sum of proper convex functions. We consider a truncation method for duality and obtain the zero duality gap by using only dual variable of finite support. An application to minimum cost flow problems in infinite networks is also discussed.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Basu, A., Martin, K., Ryan, C.T.: On the sufficiency of finite support duals in semi-infinite linear programming. Oper. Res. Lett. 42(1), 16–20 (2014)

    Article  MathSciNet  Google Scholar 

  2. Bertsekas, D.P.: Network Optimization: Continuous and Discrete Models. Athena Scientific, Belmont, MA (1998)

    MATH  Google Scholar 

  3. Bertsekas, D.P.: Extended monotropic programming and duality. J. Optim. Theory Appl. 139, 209–225 (2008)

    Article  MathSciNet  Google Scholar 

  4. Bot, R.I.: Conjugate Duality in Convex Optimization. Springer, Berlin (2010)

    Book  Google Scholar 

  5. Bot, R.I., Csetnek, E.: On a zero duality gap result in extended monotropic programming. J. Optim. Theory Appl. 47, 473–482 (2010)

    Article  MathSciNet  Google Scholar 

  6. Burachik, R.S., Majeed, S.N.: Strong duality for generalized monotropic programming in infinite dimension. J. Math. Anal. Appl. 400, 541–557 (2013)

    Article  MathSciNet  Google Scholar 

  7. Ekeland, I., Temam, R.: Convex Analysis and Variational Problems. Translated from the French. Studies in Math- ematics and its Applications, Vol. 1. North-Holland Publishing Co., Amsterdam-Oxford; American Elsevier Publishing Co., Inc., New York (1976)

  8. Ghate, A.: Duality in countably infinite monotropic programs. SIAM J. Optim. 27, 2010–2033 (2017)

    Article  MathSciNet  Google Scholar 

  9. Goberna, M.A., Lopez, M.A.: Linear Infinite Optimization. Wiley, New York (1998)

    MATH  Google Scholar 

  10. Grinold, R.C.: Infinite horizon stochastic programs. SIAM J. Contr. Optim. 24, 1246–1260 (1986)

    Article  MathSciNet  Google Scholar 

  11. Ioffe, A.D., Tikhomirov, V.M.: Theory of Extremal Problems. North-Holland Pub, Comp (1979)

    Google Scholar 

  12. Laurent, P.-J.: Approximation et Optimization. Hermann (1972)

  13. Luc, D.T., Volle, M.: Duality in optimization with infinite sums. SIAM J. Optim. 29, 1819–1843 (2019)

    Article  MathSciNet  Google Scholar 

  14. Nourollahi, S., Ghate, A.: Duality in convex minimum cost flow problems on infinite networks and hypernetworks. Networks 70, 98–115 (2017)

    Article  MathSciNet  Google Scholar 

  15. Minty, G.J.: Monotone networks. Proc. R. Soc. Lond. A 257, 194–212 (1960)

    Article  MathSciNet  Google Scholar 

  16. Rockafellar, R.T.: Monotropic programming: descent algorithms and duality. In: Mangasarian, O.L., Meyer, R.R., Robinson, S.M. (eds.) Nonlinear Programming, vol. 4, pp. 327–366. Academic Press, San Diego (1981)

    Google Scholar 

  17. Rockafellar, R.T.: Network Flows and Monotropic Optimization. Wiley, Hoboken (1984)

    MATH  Google Scholar 

  18. Romeijn, H.E., Smith, R.L., Bean, J.C.: Duality in infinite dimensional linear programming. Math. Progr. 53(1–3), 79–97 (1992)

    Article  MathSciNet  Google Scholar 

  19. Romeijn, H.E., Sharma, D., Smith, R.L.: Extreme point solutions for infinite network flow problems. Networks 48, 209–222 (2006)

    Article  MathSciNet  Google Scholar 

  20. Schochetman, I.E., Smith, R.L.: Infinite horizon optimization. Math. Oper. Res. 14, 559–574 (1989)

    Article  MathSciNet  Google Scholar 

  21. Schaefer, H.H.: Topological Vector Spaces. Springer, Berlin (1986)

    Google Scholar 

  22. Sharkey, T.C., Romeijn, H.E.: A simplex algorithm for minimum cost network flow problems in infinite networks. Networks 52, 14–31 (2008)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Michel Volle.

Additional information

To Marco Lopez on occasion of his 70th birthday

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Luc, D.T., Volle, M. Duality for extended infinite monotropic optimization problems. Math. Program. 189, 409–432 (2021). https://doi.org/10.1007/s10107-020-01557-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10107-020-01557-3

Keywords

Mathematics Subject Classification

Navigation