Skip to main content
SpringerLink
Log in

Sensibility Function as Convolution of System of Optimization Problems

  • Chapter
  • First Online:
Optimization and Optimal Control

Part of the book series: Springer Optimization and Its Applications ((SOIA,volume 39))

Summary

The sensibility function generated by a convex programming problem is viewed as an element of a complex system of optimization problems. Its role in this system is clarified. The optimization problems generated by the sensibility function are considered. Methods for their solution are proposed.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Gale, D.: The Theory of Linear Economic Models, McGraw-Gill, New York, NY (1960)

    Google Scholar 

  2. Williams, A.C.: Marginal values in linear programming. J. Soc. Indust. Appl. Math. 11, 82–94 (1963)

    Article  MathSciNet  MATH  Google Scholar 

  3. Zlobec, S.: Stable Parametric Programming, Kluwer, Dordrecht (2001)

    Google Scholar 

  4. Eremin, I.I., Astafiev, N.N.: Introduction to Linear and Convex Programming Theory, Nauka, Moscow (1976)

    Google Scholar 

  5. Elster, K.-H., Reinhardt, R., Schaubel, M., Donath, G.: Einfuhrung in die nichtlineare optimierung, BSB B.G. Teubner, Leipzig (1977)

    Google Scholar 

  6. Rzhevskii, S.V.: Monotone Methods of Convex Programming, Naukova Dumka, Kiev (1993)

    Google Scholar 

  7. Golikov, A.I.: Characterization of optimal estimates set for multicriterial optimization problems. U.S.S.R. Comput. Math. Math. Phys. 28(10), 1285–1296 (1988)

    MathSciNet  Google Scholar 

  8. Zhadan, V.G.: Modified Lagrangian method for multicriterial optimization. U.S.S.R. Comput. Math. Math. Phys. 28(11), 1603–1617 (1988)

    MathSciNet  Google Scholar 

  9. Rockafellar, R.T., Wets, R.J-B.: Variational Analysis, Springer, Berlin (1998)

    Google Scholar 

  10. Vasil’ev, F.P.: Optimization Methods, Factorial Press, Moscow (2002)

    Google Scholar 

  11. Antipin, A.S.: Methods of solving systems of convex programming problems. Zhurnal Vychisl. Mat. Mat. Phiziki. 27(3), 368–376 (1987) English transl. U.S.S.R. Comput. Math. Math. Phys. 27(2), 30–35 (1987)

    Google Scholar 

  12. Antipin, A.S.: Models of interaction between manufacturers,consumers, and the transportation system. Avtomatika i telemechanika. 10, 105–113 (1989). English transl. Autom Remote Control., 1391–1398 (1990)

    Google Scholar 

  13. Karlin, S.: Mathematical Methods and Theory in Games, Programming, and Economics, Pergamon Press, London (1959)

    Google Scholar 

  14. Antipin, A.S.: Inverse optimization problem. Economic-mathematical cyclopaedic dictionary. “Large Russian Encyclopaedia”. “Infra-M”, 346–347 (2003)

    Google Scholar 

  15. Antipin, A.S.: An extraproximal method for solving equilibrium programming problems and games. Comput. Math. Math. Phys. 45(11), 1893–1914 (2005)

    MathSciNet  Google Scholar 

  16. Antipin, A.S.: An extraproximal method for solving equilibrium programming problems and games with coupled constraints. Comput. Math. Math. Phys. 45(12), 2020–2022 (2005)

    MathSciNet  Google Scholar 

  17. Antipin, A.S.: Controlled proximal differential systems for saddle problems. The Differentsial’nye Uravneniya. 28(11), 1846–1861 (1992). English transl.: Differ. Equ. 28(11), 1498–1510 (1992)

    Google Scholar 

  18. Antipin, A.S.: The convergence of proximal methods to fixed points of extremal mappings and estimates of their rate of convergence. Zhurnal Vychisl. Mat. Mat. Fiz. 35(5), 688–704 (1995) English transl. Comput. Math. Math. Phys. 35(5), 539–551 (1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computing Center of Russian Academy of Sciences, Vavilov str., 40, 119333, Moscow, Russia

    Anatoly Antipin

Authors
  1. Anatoly Antipin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Anatoly Antipin .

Editor information

Editors and Affiliations

  1. South Kensington Campus, London, SW7 2AZ, United Kingdom

    Altannar Chinchuluun

  2. Dept. Industrial & Systems, Engineering, University of Florida, Weil Hall 303, Gainesville, 32611-6595, Florida, USA

    Panos M. Pardalos

  3. The School of Economic Studies, Dept.of Mathematics & Computer Science, National University of Mongolia, Ulaanbaatar, 210646, Mongolia

    Rentsen Enkhbat

  4. Labo. PRISM, Université Versailles, av. des Etats-Unis 45, Versailles CX, 78035, France

    Ider Tseveendorj

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Antipin, A. (2010). Sensibility Function as Convolution of System of Optimization Problems. In: Chinchuluun, ., Pardalos, P., Enkhbat, R., Tseveendorj, I. (eds) Optimization and Optimal Control. Springer Optimization and Its Applications(), vol 39. Springer, New York, NY. https://doi.org/10.1007/978-0-387-89496-6_1

Download citation

Publish with us

Policies and ethics

Search

Navigation