Skip to main content
SpringerLink
Log in

Three-Index linear programs with nested structure

  • System Analysis and Operations Research
  • Published:
Automation and Remote Control Aims and scope Submit manuscript

Abstract

This paper deals with solutions of multi-index linear programs of the transportation type. The approach based on the analysis of reducibility of multi-index transportation problems to flow algorithms is taken as the main technical tool. Sufficient conditions of reducibility are proposed, which are based on the notion of nesting for the set of problem constraints. It is shown that these conditions are necessary and sufficient for reducibility of three-index problems; otherwise, the well-know hypothesis on the non-equivalence of the classes P and NP is wrong.

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. Afraimovich, L.G. and Prilutskii, M.Kh., Multiindex Resource Distributions for Hierarchical Systems, Autom. Remote Control, 2006, no. 6, pp. 1007–1016.

  2. Afraimovich, L.G. and Prilutskii, M.Kh., Multi-commodity Flows in Tree Networks, Izv. Ross. Akad. Nauk, Teor. Sist. Upravlen., 2008, no. 2, pp. 57–63.

  3. Prilutskii, M.Kh., Multicriterial Multi-index Problems of Spatial Scheduling, Izv. Ross. Akad. Nauk, Teor. Sist. Upravlen., 2007, no. 1, pp. 78–82.

  4. Prilutskii, M.Kh., Multicriteria Distribution of a Homogeneous Resource in Hierarchical System, Autom. Remote Control, 1996, no. 2, pp. 266–271.

  5. Pusztaszeri, J., Rensing, P., and Liebling, T., Tracking Elementary Particles Near their Primary Vertex: A Combinatorial Approach, J. Global Optim., 1996, vol. 9, no. 1, pp. 41–64.

    Article  MathSciNet  MATH  Google Scholar 

  6. Poore, A.B., Multidimensional Assignment Formulation of Data Association Problems Arising from Multitarget and Multisensor Tracking, Comput. Optim. Appl., 1994, vol. 3, no. 1, pp. 27–57.

    Article  MathSciNet  MATH  Google Scholar 

  7. Schrijver, A., Theory of Linear and Integer Programming, New York: Wiley, 1986. Translated under the title Teoriya lineinogo i tselochislennogo programmirovaniya, Moscow: Mir, 1991.

    MATH  Google Scholar 

  8. Papadimitrou, Ch. and Steiglitz, K., Combinatorial Optimization: Algorithms and Complexity, Englewood Cliffs: Prentice Hall, 1982. Translated under the title Kombinatornaya optimizatsiya: Algoritmy i slozhnost’, Moscow: Mir, 1985.

    Google Scholar 

  9. Gale, D., The Theory of Linear Economic Models, New York: McGraw-Hill, 1960. Translated under the title Teoriya lineinykh ekonomicheskikh modelei, Moscow: Mir, 1969.

    Google Scholar 

  10. Raskin, L.G. and Kirichenko, I.O., Mnogoindeksnye zadachi lineinogo programmirovaniya (Multi-index Problems of Linear Programming), Moscow: Radio i Svyaz’, 1982.

    Google Scholar 

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

    MATH  Google Scholar 

  12. Bandopadhyaya, L. and Puri, M.C., Impaired Flow Multi-index Transportation Problem with Axial Constraints, J. Austral. Math. Soc., Ser. B, 1988, vol. 29, no. 3, pp. 296–309.

    Article  MathSciNet  MATH  Google Scholar 

  13. Junginger, W., On Representatives of Multi-index Transportation Problems, Eur. J. Oper. Res., 1993, vol. 66, no. 3, pp. 353–371.

    Article  MATH  Google Scholar 

  14. Verkhovskii, B.S., Multidimensional Linear Programs of the Transportation Type, Dokl. Akad. Nauk SSSR, 1963, vol. 151, no. 3, pp. 515–518.

    MathSciNet  Google Scholar 

  15. De Loera, J.A., Kim, E.D., Onn, S., and Santos, F., Graphs of Transportation Polytopes, J. Combinat. Theory, Ser. A, 2009, vol. 116, no. 8, pp. 1306–1325.

    Article  MATH  Google Scholar 

  16. Kravtsov, M.A. and Krachkovskii, A.P., On the Properties of Three-index Transportation Polyhedra, Discrete Math., 1999, vol. 11, no. 3, pp. 109–125.

    MathSciNet  Google Scholar 

  17. Garey, M.R. and Johnson, D.S., Computers and Intractability: A Guide to the Theory of NP-Completeness, San Francisco: Freeman, 1979. Translation under the title Vychislitel’nye mashiny i trudnoreshaemye zadachi, Moscow: Mir, 1982.

    MATH  Google Scholar 

  18. Frieze, A.M., Complexity of a 3-dimensional Assignment Problem, Eur. J. Oper. Res., 1983. vol. 13, no. 2, pp. 161–164.

    Article  MathSciNet  MATH  Google Scholar 

  19. Crama, Y. and Spieksma, F.C.R., Approximation Algorithms for Three-dimensional Assignment Problems with Triangle Inequalities, Eur. J. Oper. Res., 1992, vol. 60, pp. 273–279.

    Article  MATH  Google Scholar 

  20. Huang, G. and Lim, A., A Hybrid Genetic Algorithm for the Three-Index Assignment Problem, Eur. J. Oper. Res., 2006, vol. 172, pp. 249–257.

    Article  MathSciNet  MATH  Google Scholar 

  21. Ahuja, R.K., Magnati, T.L., and Orlin, J.B., Network Flows: Theory, Algorithms, and Applications, Upper Saddle River: Prentice Hall, 1993.

    MATH  Google Scholar 

  22. Galil, Z. and Tardos, E., An O(n 2(m+ n log n) log n) Min-cost Flow Algorithm, J. ACM, 1988, vol. 35, no. 2, pp. 374–386.

    Article  MathSciNet  MATH  Google Scholar 

  23. Goldberg, A.V. and Rao, S., Beyond the Flow Decomposition Barrier, J. ACM, 1998, vol. 45, no. 5, pp. 783–797.

    Article  MathSciNet  MATH  Google Scholar 

  24. Litvak, B.G. and Rappoport, A.M., Linear Programs that Admit for a Network Formulation, Ekon. Mat. Metody, 1970, vol. 6, no. 4, pp. 594–604.

    MathSciNet  Google Scholar 

  25. Lin, Y., A Recognition Problem in Converting Linear Programming to Network Flow Models, Appl. Math. A J. Chin. Univ., 1993, vol. 8, no. 1, pp. 76–85.

    Article  MATH  Google Scholar 

  26. Kovalev, M.M., Matroidy v diskretnoi optimizatsii (Matroids in Discrete Optimization), Moscow: Editorial URSS, 2003.

    Google Scholar 

  27. Gülpinar, N., Gutin, G., Mitra, G., and Zverovitch, A., Extracting Pure Network Submatrices in Linear Programs Using Signed Graphs, Discrete Appl. Math., 2004, vol. 137, no. 3, pp. 359–372.

    Article  MathSciNet  MATH  Google Scholar 

  28. Afraimovich, L.G., Cycle-based Reducibility of Multi-index Systems of Linear Inequalities of the Transportation Type, Izv. Ross. Akad. Nauk, Teor. Sist. Upravlen., 2010, no. 4, pp. 83–90.

  29. Spieksma, F.C.R., Multi Index Assignment Problems: Complexity, Approximation, Applications, in Nonlinear Assignment Problems: Algorithms and Applications, Pardalos, P.M. and Pitsoulis, L.S., Eds., Dordrecht: Kluwer, 2000, pp. 1–11.

    Google Scholar 

  30. Chen, B., Potts, C.N., and Woeginger, G.J., A Review of Machine Scheduling: Complexity, Algorithms and Approximability, in Handbook of Combinatorial Optimization, Du, D.Z. and Pardalos, P.M., Eds., Dordrecht: Kluwer, 1998, pp. 21–169.

    Google Scholar 

  31. Hoffman, A.D. and Kruskal, J.B., Tselochislennye granichnye tochki vypuklykh mnogogrannikov. Lineinye neravenstva i smezhnye voprosy (Integral Boundary Points of Convex Polyhedra. Linear Inequalities and Related Systems). Moscow: Inostrannaya Literatura, 1959, pp. 325–347.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Nizhni Novgorod State University, Nizhni Novgorod, Russia

    L. G. Afraimovich

Authors
  1. L. G. Afraimovich
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Original Russian Text © L.G. Afraimovich, 2011, published in Avtomatika i Telemekhanika, 2011, No. 8, pp. 109–120.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Afraimovich, L.G. Three-Index linear programs with nested structure. Autom Remote Control 72, 1679–1689 (2011). https://doi.org/10.1134/S0005117911080066

Download citation

  • Received:

  • Published:

  • Issue Date:

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

Keywords

Search

Navigation