Skip to main content
Log in

Test problem generation for quadratic-linear pessimistic bilevel optimization

  • Published:
Numerical Analysis and Applications Aims and scope Submit manuscript

Abstract

A generation method of quadratic-linear bilevel optimization test problems in a pessimistic formulation is proposed and justified. Propositions about the exact form and the number of local and global pessimistic solutions in generated problems are proved.

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.

Institutional subscriptions

Similar content being viewed by others

References

  1. Polyak, B.T., Vvedenie v optimizatsiyu (Introduction to Optimization), Moscow: Nauka 1983.

    MATH  Google Scholar 

  2. Strekalovskii, A.S. and Orlov, A.V., Bimatrichnye igry i bilineynoe programmirovanie (Bimatrix Games and Bilinear Programming), Moscow: Fizmatlit, 2007.

    Google Scholar 

  3. DIMACS Implementation Challenges, URL: http://dimacs.rutgers.edu/Challenges/.

  4. Hock, W. and Schittkowski, K., Test Examples for Nonlinear Programming Codes, Berlin: Springer-Verlag, 1981.

    Book  MATH  Google Scholar 

  5. Schittkowski, K., More Test Examples for Nonlinear Programming Codes, Berlin: Springer-Verlag, 1987.

    Book  MATH  Google Scholar 

  6. Floudas, C.A. and Pardalos, P.M., A Collection of Test Problems for Constrained Global Optimization Algorithms, Berlin: Springer-Verlag, 1990.

    Book  MATH  Google Scholar 

  7. Sven Leyffer’s Test Problems, URL: http://wiki.mcs.anl.gov/leyffer/index.php/Sven-Leyffer’s-Test-Problems.

  8. Moshirvaziri, K., Construction of Test Problem for a Class of Reverse Convex Program, J. Optim. Th. Appl., 1994, vol. 81, no. 2, pp. 343–354.

    Article  MATH  MathSciNet  Google Scholar 

  9. Moshirvaziri, K., Generalization of the Construction of Test Problems for Nonconvex Optimization, J. Glob. Optim., 1994, vol. 5, no. 1, pp. 21–34.

    Article  MATH  MathSciNet  Google Scholar 

  10. Moshirvaziri, K., Amouzegar, M.A., and Jacobsen, S.E., Test Problem Construction for Linear Bilevel Programming Problem, J. Glob. Optim., 1996, vol. 8, pp. 235–243.

    Article  MATH  MathSciNet  Google Scholar 

  11. Moshirvaziri, K., Construction of Test Problems for Concave Minimization under Linear and Nonlinear Constraints, J. Optim. Th. Appl., 1998, vol. 98, no. 1, pp. 83–108.

    Article  MATH  MathSciNet  Google Scholar 

  12. Vicente, L., Calamai, P., and Judice, J., Generation of Disjointly Constrained Bilinear Programming Test Problems, Comput. Optim. Appl., 1992, vol. 1, no. 3, pp. 299–306.

    Article  MATH  MathSciNet  Google Scholar 

  13. Calamai, P. and Vicente, L., Generating Linear and Linear-Quadratic Bilevel Programming Problems, SIAM J. Sci. Comput., 1993, vol. 14, no. 4, pp. 770–782 (Archive).

    Article  MATH  MathSciNet  Google Scholar 

  14. Calamai, P. and Vicente, L., Generating Quadratic Bilevel Programming Test Problems, ACM Trans. Math. Soft., 1994, vol. 20, pp. 103–119.

    Article  MATH  MathSciNet  Google Scholar 

  15. Vicente, L., Calamai, P., and Judice, J., A New Technique for Generating Quadratic Test Problems, Math. Progr., 1993, vol. 61, pp. 215–231.

    Article  MATH  MathSciNet  Google Scholar 

  16. Gaviano, M., Kvasov, D.E., Lera, D., and Sergeyev, Y.D., Algorithm 829: Software for Generation of Classes of Test Functions with Known Local and Global Minima for Global Optimization, ACM Trans. Math. Soft., 2003, vol. 29, no. 4, pp. 469–480.

    Article  MATH  MathSciNet  Google Scholar 

  17. Dempe, S., Foundations of Bilevel Programming, Dordrecht, The Netherlands: Kluwer, 2002.

    MATH  Google Scholar 

  18. Germeyer, Yu.B., Igry s neprotivopolozhnymi interesami (Games with Non-Opposite Interests) Moscow: Nauka, 1976.

    Google Scholar 

  19. Malyshev, A.V. and Strekalovskii, A.S., Relationship between Some Problems of Bilevel and Nonlinear Optimization, Izv. Vuzov, Mat., 2011, no. 4, pp. 99–103.

    Google Scholar 

  20. Malyshev, A.V. and Strekalovskii, A.S., Global Search for Pessimistic Solutions in Quadratic-Linear Problems of Bilevel Optimization, Izv. Irkut. Gos. Univ., 2011, vol. 4, no. 1, pp. 73–82.

    MATH  Google Scholar 

  21. Wiesemann, W., Tsoukalas, A., Kleniati, P.-M., and Rustem, B., Pessimistic Bilevel Optimization, SIAM J. Optim., 2013, vol. 23, no. 1, pp. 353–380.

    Article  MATH  MathSciNet  Google Scholar 

  22. Vasil’ev, F.P. and Ivanitskii, A.Yu., Lineynoe programmirovanie (Linear Programming), Moscow: Faktorial, 1998.

    Google Scholar 

  23. Bazaraa, M. and Shetty, C., Nonlinear Programming: Theory and Algorithms [Russian translation], Moscow: Mir, 1982.

    MATH  Google Scholar 

  24. Ivanov, B.N., Diskretnaya matematika. Algoritmy i programmy: Ucheb. posobie (Discrete Mathematics. Algorithms and Codes: Tutorial), Moscow: Laboratoriya Bazovykh Znanii, 2002.

    Google Scholar 

  25. Kalitkin, N.N., Chislennye metody (Numerical Methods), Moscow: Nauka, 1978.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to A. V. Orlov.

Additional information

Original Russian Text © A.V. Orlov, A.V. Malyshev, 2014, published in Sibirskii Zhurnal Vychislitel’noi Matematiki, 2014, Vol. 17, No. 3, pp. 245–257.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Orlov, A.V., Malyshev, A.V. Test problem generation for quadratic-linear pessimistic bilevel optimization. Numer. Analys. Appl. 7, 204–214 (2014). https://doi.org/10.1134/S1995423914030033

Download citation

  • Received:

  • Published:

  • Issue Date:

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

Keywords

Navigation