Abstract
Transportation problems have been the subject of extensive literature [4, 6–8, 10, 21, 26]. Whereas effective accurate methods have been developed for linear transportation problems, no general accurate optimization methods for nonlinear problems are available to this day. Optimization of (convex or concave) objective functions by means of convex programming is the most advanced field of nonlinear studies [1, 23–25]. Dynamic programming methods are also applicable under certain conditions [3, 9, 27]. Optimization may lead to good results when functional are approximated by piecewise linear functions [2, 20]. Minimax problems commonly arise in operations research [9, 19, 22].
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References to Chapter 2
Alekseev V.M., Tikhomirov V.M., and Fomin S.V., OptimaVnoe upravlenie (Optimal Control), Moscow: Nauka, 1979.
Astakhov N.D., Fedoseev A.V., and Chan Van Khung, 0 primenenii uskoren-nykh algoritmov resheniya zadach transportnogo tipa (On the Use of Accelerated Algorithms for Solving Transportation Problems), Moscow: Computing Center of Russ. Acad. Sci., 1994.
Bellman R. Dynamic Programming, Princeton: Princeton Univ. Press, 1957.
Gol’shtein E.G. and Yudin D.B., Zadachi lineinogo programmirovania trans-portnogo tipa (Transportation Problems in Linear Programming), Moscow: Nau-ka, 1969.
Dem’yaninov V. F. and Malozemov V. N., Vvedenie v minimaks (Introduction to Minimax), Moscow: Nauka, 1972.
Emelichev V. A. and Kovalev M.M., Mnogograrmiki, grafy, optimizatsiya (Polyhedrons, Graphs, and Optimization), Moscow: Nauka, 1981.
Emelichev V.A. and Kononenko A.M., On a Class of Transportation Polyhedrons, Izv. Belarus. Akad. NaukSer. Fiz. Mat., 1971, no. 3, pp. 21–23.
Karmanov V.G., Matematicheskoe programmirovanie (Mathematical programming), Moscow: Nauka, 1986.
Krasnoshchekov P. S. and Petrov A. A., Printsipy postroeniya modelet (Principles of Model Construction), Moscow: Mosk. Gos. Univ., 1983.
Kuznetsov A.V., Sakovich V. A., and Kholod N. N., Vysshaya matematika. Matematicheskoe programmirovanie (Higher Mathematics: Mathematical programming), Minsk: Vysshaya Shkola, 1994.
Mironov A. A., Properties of the Sets of Degrees of the Vertices of Generalized Graphs, Dokl. Akad. Nauk, 1992, vol. 324, no. 5, pp. 959–963.
Mironov A. A., Generalized Graphs with Constraints for the Degrees of Vertices, Dokl. Akad. Nauk, 1993, vol. 336, no. 4, pp. 437–439.
Mironov A.A. and Tsurkov V.l., Network Models with Fixed Parameters at the Connection Nodes I, Izv. Akad. Nauk, Ser. Tekhn. Kibern., 1993, no. 4, pp. 212–223.
Mironov A. A. and Tsurkov V. I., Network Models with Fixed Parameters at the Connection Nodes II, Izv. Akad. Nauk, Ser. Tekhn. Kibern., 1993, no. 6, pp. 3–14.
Mironov A. A. and Tsurkov V. I., A Class of Distributed Problems with Minimax Criteria, Dokl. Akad. Nauk, 1992, vol. 336, no. 1, pp. 35–38.
Mironov A.A. and Tsurkov V.l., Transportation and Network Problems with Minimax Criteria, Zh. Vychisl. Mat. Mat. Fiz., 1995, vol. 35, no. 1, pp. 24–45.
Mironov A.A. and Tsurkov V.l., Transportation Problems with Minimax Criteria, Avtom. Telemekh., 1995, no. 12, pp. 109–118.
Mironov A.A. and Tsurkov V.l., Transportation Problems with Minimax Criteria, Dokl. Akad. Nauk, 1996, vol. 346, no. 2, pp. 1–4.
Sovremennoe sostoyanie teorii issledovaniya operatsii (Modern Theory of Operations Research), Moiseev, N.N., Ed., Moscow: Nauka, 1979.
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.
Mukhacheva E. A. and Rubinshtein G.Sh., Matematicheskoe programmirovanie (Mathematical Programming), Novosibirsk: Nauka, 1977.
Panos M. Pardalos, Minimax and Applications, University of Minnesota and Institute of Applied Mathematics, Beijing: Academia Sinica, 1995.
Pshenichnyi B. N., Vypuklyi analiz i ekstremaVnye zadachi (Convex Analysis and Extremum Value Problems), Moscow: Nauka, 1980.
Rockafellar R. T., Convex Analysis, Princeton: Princeton Univ. Press, 1970. Translated under the title Vypuklyi analiz,, Moscow: Mir, 1973.
Sukharev A. G., Timokhov, A.V., and Fedorov, V.V., Kurs metodov optimizatsii (Lectures on Optimization Methods), Moscow: Nauka, 1986.
Trius E.B., Zadachi matematicheskogo programmirovaniya transportnogo tipa (Transportation Problems in Mathematical Programming), Moscow: Sovetskoe Radio, 1967.
Tsurkov V. I., Dinamicheskie zadachi boVshoi razmernosti (Dynamic Large-Scale Problems), Moscow: Nauka, 1988.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Tsurkov, V., Mironov, A. (1999). Minimax Criteria and Solution Methods for Transportation Problems. In: Minimax Under Transportation Constrains. Applied Optimization, vol 27. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-4060-1_2
Download citation
DOI: https://doi.org/10.1007/978-1-4615-4060-1_2
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-6818-2
Online ISBN: 978-1-4615-4060-1
eBook Packages: Springer Book Archive