Skip to main content
Log in

Nonlinear integer transportation problem with additional supply and consumption points

  • Systems Analysis and Operations Research
  • Published:
Journal of Computer and Systems Sciences International Aims and scope

Abstract

An iterative decomposition method based on the sequential solution of two-dimensional problems subject to constraints from different groups is successfully applied to the case of integer transportation problems with convex objective functions and ascribed suppliers and consumers is proposed. Through the introduction of new variables, it has been possible to extend the constructions of the algorithm in which the central point is the solution of optimization problems with two constraints. A detailed analysis of these problems is presented in the present paper.

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. A. P. Tizik and V. I. Tsurkov, “Iterative functional modification method for solving a transportation problem,” Autom. Remote Control 73, 134–143 (2012).

    Article  MathSciNet  MATH  Google Scholar 

  2. E. G. Gol’shtein and D. B. Yudin, Linear Programming Problems of Transportation Type (Nauka, Moscow, 1969) [in Russian].

    MATH  Google Scholar 

  3. E. B. Trius, Mathematical Programming Problems of Transportation Type (Sovetskoe radio, Moscow, 1967) [in Russian].

    Google Scholar 

  4. A. S. Esenkov, D. I. Kuzovlev, V. Yu. Leonov, A. P. Tizik, V. I. Tsurkov, “Network optimization and problems with coupling variables,” J. Comput. Syst. Sci. Int. 53, 369–383 (2014).

    Article  MathSciNet  MATH  Google Scholar 

  5. A. A. Sokolov, A. P. Tizik, and V. I. Tsurkov, “Iterative method for the transportation problem with additional supply and consumption points and quadratic cost,” J. Comput. Syst. Sci. Int. 52, 588–598 (2013).

    Article  MathSciNet  MATH  Google Scholar 

  6. A. A. Mironov, T. A. Levkina, and V. I. Tsurkov, “Minimax estimations of arc weights in integer networks with fixed node degrees,” Appl. Comput. Math. 8, 216–226 (2009).

    MathSciNet  MATH  Google Scholar 

  7. A. A. Mironov and V. I. Tsurkov, “Class of distribution problems with minimax criterion,” Dokl. Ross. Akad. Nauk 336, 35–38 (1994).

    MathSciNet  MATH  Google Scholar 

  8. A. A. Mironov and V. I. Tsurkov, “Transport Problems with a Minimax Criterion,” Dokl. Ross. Akad. Nauk 346, 168–171 (1996).

    MathSciNet  MATH  Google Scholar 

  9. A. A. Mironov and V. I. Tsurkov, “Hereditarily minimax matrices in models of transportation type,” J. Comput. Syst. Sci. Int. 37, 927–944 (1998).

    MathSciNet  MATH  Google Scholar 

  10. A. A. Mironov and V. I. Tsurkov, “Minimax transportation models with integral constraints. I,” J. Comput. Syst. Sci. Int. 42, 562–574 (2003).

    MathSciNet  MATH  Google Scholar 

  11. A. A. Mironov, V. V. Fedorchuk, and V. I. Tsurkov, “Minimax transportation models with integral constraints. II,” J. Comput. Syst. Sci. Int. 44, 732–752 (2005).

    MathSciNet  MATH  Google Scholar 

  12. A. A. Mironov and V. I. Tsurkov, “Closed transportation models with minimax criterion,” Autom. Remote Control 63, 388–398 (2002).

    Article  MathSciNet  MATH  Google Scholar 

  13. A. A. Mironov and V. I. Tsurkov, “Open transportation models with minimax criterion,” Dokl. Math. 64, 374–377 (2001).

    MathSciNet  MATH  Google Scholar 

  14. A. A. Mironov and V. I. Tsurkov, “Minimax under nonlinear transportation constraints,” Dokl. Math. 64, 351–354 (2001).

    MathSciNet  MATH  Google Scholar 

  15. A. A. Mironov and V. I. Tsurkov, “Network models with fixed parameters at the communication nodes. 1,” J. Comput. Syst. Sci. Int. 33(3), 107–116 (1995).

    MathSciNet  MATH  Google Scholar 

  16. A. A. Mironov and V. I. Tsurkov, “Network models with fixed parameters at the communication nodes. 2,” J. Comput. Syst. Sci. Int. 32(6), 1–11 (1994).

    MathSciNet  MATH  Google Scholar 

  17. A. P. Tizik and V. I. Tsurkov, “Optimal channel distribution in communications networks,” Sov. J. Comput. Syst. Sci. 28(2), 24–31 (1990).

    MATH  Google Scholar 

  18. A. A. Mironov and V. I. Tsurkov, “Transport and network problems with the minimax criterion,” Comput. Math. Math. Phys. 35, 15–30 (1995).

    MathSciNet  MATH  Google Scholar 

  19. A. A. Mironov and V. I. Tsurkov, “Hereditarily minimax matrices in models of transportation type,” J. Comput. Syst. Sci. Int. 37, 97–944 (1998).

    MathSciNet  MATH  Google Scholar 

  20. A. A. Mironov and V. I. Tsurkov, “Transport-type problems with a criterion,” Avtom. Telemekh., No. 12, 109–118 (1995).

    Google Scholar 

  21. A. P. Tizik and V. I. Tsurkov, “Metod posledovatel’noi modifikatsii funktsionala dlya resheniya transportnoi zadachi,” Avtom. Telemekh., No. 1, 148–158 (2012).

    Google Scholar 

  22. V. I. Tsurkov, “An Iterative Method of the Decomposition for Extremum Problems,” Doklady akademii nauk 250(2), 304–307 (1980).

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to A. P. Tizik.

Additional information

Original Russian Text © A.S. Esenkov, V.Yu. Leonov, A.P. Tizik, V.I. Tsurkov, 2015, published in Izvestiya Akademii Nauk. Teoriya i Sistemy Upravleniya, 2015, No. 1, pp. 88–94.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Esenkov, A.S., Leonov, V.Y., Tizik, A.P. et al. Nonlinear integer transportation problem with additional supply and consumption points. J. Comput. Syst. Sci. Int. 54, 86–92 (2015). https://doi.org/10.1134/S1064230715010050

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S1064230715010050

Keywords

Navigation