Skip to main content

One-sided Max-linear Systems and Max-algebraic Subspaces

  • Chapter
Max-linear Systems: Theory and Algorithms

Part of the book series: Springer Monographs in Mathematics ((SMM))

Abstract

Two approaches for solving one-sided max-linear systems are presented, combinatorial and algebraic. This fact highlights two fundamental aspects of max-algebra: its combinatorial nature and a specific way of dealing with the virtual non-existence of inverse matrices due to the lack of subtraction. In the latter case the significance of dual operators, matrix conjugation and extension of the ground set by an upper bound is demonstrated.

Since the solvability question is essentially deciding whether a vector is in a subspace (column space of a matrix), later in this chapter a theory of max-algebraic subspaces is presented. This includes the concepts of generators, independence and bases. A description of bases for general max-algebraic subspaces is given using extremals; it then follows that every finitely generated subspace has a unique scaled basis. Dimensional anomalies and unsolvable systems are also discussed.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and 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

References

  1. Akian, M., Gaubert, S., & Kolokoltsov, V. (2002). Invertibility of functional Galois connections. Comptes Rendus de L’Academie Des Sciences Paris, 335, 883–888.

    MathSciNet  MATH  Google Scholar 

  2. Butkovič, P. (1994). Strong regularity of matrices—a survey of results. Discrete Applied Mathematics, 48, 45–68.

    Article  MathSciNet  MATH  Google Scholar 

  3. Butkovič, P. (2003). Max-algebra: the linear algebra of combinatorics? Linear Algebra and Its Applications, 367, 313–335.

    Article  MathSciNet  MATH  Google Scholar 

  4. Butkovič, P. (2008). Permuted max-algebraic (tropical) eigenvector problem is NP-complete. Linear Algebra and Its Applications, 428, 1874–1882.

    Article  MathSciNet  MATH  Google Scholar 

  5. Butkovič, P., & Tam, K. P. (2009). On some properties of the image set of a max-linear mapping. In G. L. Litvinov & S. N. Sergeev (Eds.), Contemporary mathematics series : Vol. 495. Tropical and idempotent mathematics (pp. 115–126). Providence: AMS.

    Chapter  Google Scholar 

  6. Butkovič, P., Schneider, H., & Sergeev, S. (2007). Generators, extremals and bases of max cones. Linear Algebra and Its Applications, 421, 394–406.

    Article  MathSciNet  MATH  Google Scholar 

  7. Cechlárová, K., & Cuninghame-Green, R. A. (2003). Soluble approximation of linear systems in max-plus algebra. Kybernetika (Prague), 39(2), 137–141. Special issue on max-plus algebras (Prague, 2001).

    MathSciNet  MATH  Google Scholar 

  8. Cohen, G., Gaubert, S., & Quadrat, J.-P. (2004). Duality and separation theorems in idempotent semimodules. Linear Algebra and Its Applications, 379, 395–422. Tenth conference of the international linear algebra society.

    Article  MathSciNet  MATH  Google Scholar 

  9. Cohen, G., Gaubert, S., & Quadrat, J.-P. (2006). Projection and aggregation in maxplus algebra. In Systems control found appl. Current trends in nonlinear systems and control (pp. 443–454). Boston: Birkhäuser.

    Chapter  Google Scholar 

  10. Cohen, G., Gaubert, S., Quadrat, J.-P., & Singer, I. (2005). Max-plus convex sets and functions. In Contemp. math. : Vol. 377. Idempotent mathematics and mathematical physics (pp. 105–129). Providence: Amer. Math. Soc.

    Chapter  Google Scholar 

  11. Cuninghame-Green, R. A. (1960). Process synchronisation in a steelworks—a problem of feasibility. In Banbury & Maitland (Eds.), Proc. 2nd int. conf. on operational research (pp. 323–328). London: English University Press.

    Google Scholar 

  12. Cuninghame-Green, R. A. (1976). Projections in minimax algebra. Mathematical Programming, 10(1), 111–123.

    Article  MathSciNet  MATH  Google Scholar 

  13. Cuninghame-Green, R. A. (1979). Lecture notes in economics and math systems : Vol. 166. Minimax algebra. Berlin: Springer. (Downloadable from http://web.mat.bham.ac.uk/P.Butkovic/).

    Book  MATH  Google Scholar 

  14. Cuninghame-Green, R. A., & Butkovič, P. (2004). Bases in max-algebra. Linear Algebra and Its Applications, 389, 107–120.

    Article  MathSciNet  MATH  Google Scholar 

  15. Develin, M., & Sturmfels, B. (2004). Tropical convexity. Documenta Mathematica, 9, 1–27.

    MathSciNet  MATH  Google Scholar 

  16. Garey, M. R., & Johnson, D. S. (1979). Computers and intractability. A guide to the theory of NP-completeness. San Francisco: W. H. Freeman and Co.

    MATH  Google Scholar 

  17. Gaubert, S., & Katz, R. (2006). Max-plus convex geometry. In Lecture notes in comput. sci. : Vol. 4136. Relations and Kleene algebra in computer science (pp. 192–206). Berlin: Springer.

    Chapter  Google Scholar 

  18. Gaubert, S., & Katz, R. (2007). The Minkowski theorem for max-plus convex sets. Linear Algebra and Its Applications, 421, 356–369.

    Article  MathSciNet  MATH  Google Scholar 

  19. Helbig, S. (1988). Caratheodory’s and Krein-Milman’s theorems in fully ordered groups. Commentationes Mathematicae Universitatis Carolinae, 29, 157–167.

    MathSciNet  MATH  Google Scholar 

  20. Joswig, M. (2005). Tropical halfspaces. In J. E. Goodman, J. Pach, & E. Welzl (Eds.), MSRI publications : Vol. 52. Combinatorial and computational geometry (pp. 409–431). Cambridge: Cambridge University Press.

    Google Scholar 

  21. Papadimitriou, C. H., & Steiglitz, K. (1998). Combinatorial optimization—algorithms and complexity. Mineola: Dover Publications.

    MATH  Google Scholar 

  22. Rosen, K. H. et al. (2000). Handbook of discrete and combinatorial mathematics. New York: CRC Press.

    MATH  Google Scholar 

  23. Sergeev, S. (2007). Max-plus definite matrix closures and their eigenspaces. Linear Algebra and Its Applications, 421, 182–201.

    Article  MathSciNet  MATH  Google Scholar 

  24. Vorobyov, N. N. (1967). Extremal algebra of positive matrices. Elektronische Informationsverarbeitung und Kybernetik, 3, 39–71 (in Russian).

    MathSciNet  Google Scholar 

  25. Wagneur, E. (1988). Finitely generated moduloïds: The existence and unicity problem for bases. In J. L. Lions & A. Bensoussan (Eds.), Lecture notes in control and inform. sci. : Vol. 111. Analysis and optimization of systems, Antibes, 1988 (pp. 966–976). Berlin: Springer.

    Chapter  Google Scholar 

  26. Wagneur, E. (1991). Moduloïds and pseudomodules: 1. Dimension theory. Discrete Mathematics, 98, 57–73.

    Article  MathSciNet  MATH  Google Scholar 

  27. Zimmermann, K. (1976). Extremální algebra. Výzkumná publikace Ekonomicko-matematické laboratoře při Ekonomickém ústavě ČSAV 46 Praha (in Czech).

    Google Scholar 

  28. Zimmermann, U. (1981). Annals of discrete mathematics : Vol. 10. Linear and combinatorial optimization in ordered algebraic structures. Amsterdam: North-Holland.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag London Limited

About this chapter

Cite this chapter

Butkovič, P. (2010). One-sided Max-linear Systems and Max-algebraic Subspaces. In: Max-linear Systems: Theory and Algorithms. Springer Monographs in Mathematics. Springer, London. https://doi.org/10.1007/978-1-84996-299-5_3

Download citation

Publish with us

Policies and ethics