Skip to main content
SpringerLink
Log in

Closed Transportation Models with Minimax Criterion

  • Published:
Automation and Remote Control Aims and scope Submit manuscript

Abstract

Transportation problems are investigated by replacing the classical transportation cost minimization functionals by minimax functionals. Transportation models with minimax criteria are described and optimization algorithms for them are designed. A formula for computing the minimax matrix (a matrix of the classical transportation polyhedron whose largest element is minimal) of the transportation polyhedron is derived. One of the algorithms generates a (hereditarily minimax) matrix such that every each of its submatrices is a minimax matrix of the transportation polyhedron to which the matrix belongs.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

REFERENCES

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

    Google Scholar 

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

    Google Scholar 

  3. Mironov, A.A. and Tsurkov, V.I., A Class of Distributed Problems with Minimax Criterion, Dokl. Ross. Akad. Nauk, 1994, vol. 336, no. 1, pp. 35–38.

    Google Scholar 

  4. Mironov, A.A. and Tsurkov, V.I., Transport and Network Problems with Minimax Criterion, Zh. Vychisl. Mat. Mat. Fiz., 1995, vol. 35, no. 1, pp. 24–45.

    Google Scholar 

  5. Mironov, A.A. and Tsurkov, V.I., Transport Problem with Minimax Criterion, Avtom. Telemekh., 1995, no. 12, pp. 109–118.

  6. Mironov, A.A. and Tsurkov, V.I., Transport Problems with Minimax Criterion, Dokl. Ross. Akad. Nauk, 1996, vol. 346, no. 2, pp. 1–4.

    Google Scholar 

  7. Mironov, A.A. and Tsurkov, V.I., Minimaks v trasportnykh zadachakh (Minimax in Transport Problems), Moscow: Nauka, 1997.

    Google Scholar 

  8. Mironov, A.A. and Tsurkov, V.I., Hereditarily Minimax Matrices in Transport Models, Ivz. Ross. Akad. Nauk., Teor. Sist. Upravlen., 1998, no. 6, pp. 104–121.

  9. Tsurkov, V. and Mironov, A. Minimax under Transportation Constraints, London: Kluwer, 1999.

    Google Scholar 

  10. Trius, E.B. Zadachi matematicheskogo programmirovaniya transportnogo tipa (Transport-Type Mathematical Programming Problems), Moscow: Sovetskoe Radio, 1967.

    Google Scholar 

  11. Owen, G., Game Theory, Philadelphia: Saunders, 1968. Translated under the title Teoriya igr, Moscow: Mir, 1971.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Aviation Engineering Institute (Tsiolkovskii University of Technology), Moscow, Russia

    A. A. Mironov

  2. Computer Centre, Russian Academy of Sciences, Moscow, Russia

    V. I. Tsurkov

Authors
  1. A. A. Mironov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. V. I. Tsurkov
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mironov, A.A., Tsurkov, V.I. Closed Transportation Models with Minimax Criterion. Automation and Remote Control 63, 388–398 (2002). https://doi.org/10.1023/A:1014794115686

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1014794115686

Keywords

Search

Navigation