Skip to main content

Part of the book series: Applied Optimization ((APOP,volume 27))

  • 191 Accesses

Abstract

In this chapter, we construct convex hulls of the set of extremal vector pairs and on the set of the corresponding extremal matrices. We analyze optimization problems posed on sets of uniform matrices.

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

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References to Chapter 5

  1. Alekseev V.M., Tikhomirov V.M., and Fomin S.V., Optimal’noe upravlenie ( Optimal Control ), Nauka, 1979.

    Google Scholar 

  2. Glazman I. M. and Lyubich Yu.I., Konechnomernyi lineinyi analiz (Finite-Dimensional Linear Analysis), Moscow: Nauka, 1969.

    Google Scholar 

  3. GoPshtein E.G. and Yudin D.B, Zadachi lineinogo programmirovaniya trans-portnogo tipa (Transportation Problems in Linear Programming), Moscow: Nauka, 1969.

    Google Scholar 

  4. Dunford N. and Schwartz J.T., Linear Operators, Part 1: General Theory, New York: Interscience, 1958. Translated under the title Lineinye operatory (obshchaya teoriya), Moscow: Mir, 1962.

    Google Scholar 

  5. Emelichev V.A., Kovalev M.M., and Kravtsov M.K., Mnogogranniki, grafy, optimizatsiya (Polyhedrons, Graphs, and Optimization), Moscow: Nauka, 1981.

    Google Scholar 

  6. Karmanov V.G., Matematicheskoe programmirovanie (Mathematical Programming), Moscow: Nauka, 1969.

    Google Scholar 

  7. Kuznetsov A.V., Sakovich V. A., and Kholod N. N., Vysshaya matematika. Matematicheskoe programmirovanie (Higher Mathematics: Mathematical programming), Minsk: Vysshaya Shkola, 1994.

    Google Scholar 

  8. Mironov A.A., Geometry of the Points in the Space R n that Can Be Realized in a Graph, Usp. Mat. Nauk, 1977, vol. 32, no. 6, pp. 231–232.

    MathSciNet  MATH  Google Scholar 

  9. Mironov A.A. and Tsurkov V.l., Approximation and Decomposition by Means of Extremal Graphs, Zh. VychisL Mat. Mat. Fiz. 1993, vol. 33, no. 2, pp. 283–298.

    MathSciNet  MATH  Google Scholar 

  10. Mironov A.A., Uniform Generalized Graphs, Dokl Akad. Nauk, 1996, vol. 351, no. 4, pp. 465–468.

    MathSciNet  Google Scholar 

  11. Moder J. and Elmaghraby S.S., Handbook of Operations Research, New York: Van Nostrand, 1978. Translated under the title Issledovanie operatsii. Metodolo-gicheskie osnovy i matematicheskie metody, vol. 1, Moscow: Mir, 1981.

    Google Scholar 

  12. Trius E.B., Zadachi matematicheskogo programmirovamya transportnogo tipa (Transportation Problems in Mathematical Programming), Moscow: Sovetskoe Radio, 1967.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Tsurkov, V., Mironov, A. (1999). Fundamental Polyhedrons. In: Minimax Under Transportation Constrains. Applied Optimization, vol 27. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-4060-1_5

Download citation

  • DOI: https://doi.org/10.1007/978-1-4615-4060-1_5

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-6818-2

  • Online ISBN: 978-1-4615-4060-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics