Skip to main content

Tropical Analogues of a Dempe-Franke Bilevel Optimization Problem

  • Conference paper
  • First Online:
Optimization of Complex Systems: Theory, Models, Algorithms and Applications (WCGO 2019)

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 991))

Included in the following conference series:

  • 1709 Accesses

Abstract

We consider the tropical analogues of a particular bilevel optimization problem studied by Dempe and Franke [4] and suggest some methods of solving these new tropical bilevel optimization problems. In particular, it is found that the algorithm developed by Dempe and Franke can be formulated and its validity can be proved in a more general setting, which includes the tropical bilevel optimization problems in question. We also show how the feasible set can be decomposed into a finite number of tropical polyhedra, to which the tropical linear programming solvers can be applied.

Supported by EPSRC grant EP/P019676/1.

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 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Notes

  1. 1.

    In other words, \(e^{f(x,y)}\) is continuous and the sets \(\{y\in \mathbb {R}_+^n:\log (y)\in {\text {TP}}_1\}\) and \(\{z\in \mathbb {R}_+^n:\log (z)\in {\text {TP}}_1\}\) are compact in the usual Euclidean topology.

References

  1. Allamigeon, X., Benchimol, P., Gaubert, S., Joswig, M.: Tropicalizing the simplex algorithm. SIAM J. Discrete Math. 29(2), 751–795 (2015)

    Google Scholar 

  2. Allamigeon, X., Gaubert, S., Goubault, É.: Computing the vertices of tropical polyhedra using directed hypergraphs. Discrete Comput. Geom. 49, 247–279 (2013)

    Google Scholar 

  3. Butkovič, P.: Max-linear Systems: Theory and Algorithms. Springer, London (2010)

    Google Scholar 

  4. Dempe, S., Franke, S.: Solution algorithm for an optimistic linear Stackelberg problem. Comput. Oper. Res. 41, 277–281 (2014)

    Google Scholar 

  5. De Schutter, B., Heemels, W.P.M.H., Bemporad, A.: On the equivalence of linear complementarity problems. Oper. Res. Lett. 30(4), 211–222 (2002)

    Google Scholar 

  6. De Schutter, B., Heemels, W.P.M.H., Bemporad, A.: Max-plus-algebraic problems and the extended linear complementarity problem–algorithmic aspects. In: Proceedings of the 15th IFAC World Congress. Barcelona, Spain (2002)

    Google Scholar 

  7. Gaubert, S., Katz, R.D., Sergeev, S.: Tropical linear-fractional programming and parametric mean-payoff games. J. Symb. Comput. 47(12), 1447–1478 (2012)

    Google Scholar 

  8. Helbig, S.: On Carathéodory’s and Krein-Milman’s theorems in fully ordered groups. Comment. Math. Univ. Carolin. 29(1), 157–167 (1988)

    Google Scholar 

  9. Preparata, F.P., Shamos, M.I.: Computational Geometry: An Introduction. Springer, New York (1985)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Sergeĭ Sergeev .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Sergeev, S., Liu, Z. (2020). Tropical Analogues of a Dempe-Franke Bilevel Optimization Problem. In: Le Thi, H., Le, H., Pham Dinh, T. (eds) Optimization of Complex Systems: Theory, Models, Algorithms and Applications. WCGO 2019. Advances in Intelligent Systems and Computing, vol 991. Springer, Cham. https://doi.org/10.1007/978-3-030-21803-4_69

Download citation

Publish with us

Policies and ethics