Skip to main content
SpringerLink
Log in
Book cover

Convex Analysis and Global Optimization pp 453–487Cite as

Optimization Under Equilibrium Constraints

  • Chapter
  • First Online:

  • 4364 Accesses

Part of the book series: Springer Optimization and Its Applications ((SOIA,volume 110))

Abstract

An important class of optimization problems has constraints of a particular type called equilibrium constraints which arise from many applications in natural sciences, engineering, and economics. Up to recently most methods developed for solving these problems have been essentially local optimization methods. Few methods have been concerned with finding a global optimal solution. This chapter presents a global optimality approach to this class of problems in the most important special cases that include: bilevel programming, optimization over the efficient set, and optimization with variational inequality constraint.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   99.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   129.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   129.00
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

Learn about institutional subscriptions

References

  • Auchumuty, G.: Variational principles for variational inequalities. Numer. Funct. Anal. Optim. 10, 863–874 (1989)

    Article  MathSciNet  Google Scholar 

  • Auslender, A.: Optimisation, Méthodes Numériques. Masson, Paris (1976)

    MATH  Google Scholar 

  • Bach-Kim, N.T.: An algorithm for optimization over the efficient set. Vietnam J. Math. 28, 329–340 (2000)

    MathSciNet  MATH  Google Scholar 

  • Baer, E., et al.: Biological and synthetic hierarchical composites. Phys. Today 46, 60–67 (1992)

    Article  Google Scholar 

  • Ben-Ayed, O.: Bilevel linear programming. Comput. Oper. Res. 20, 485–501 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  • Benson, H.P.: Optimization over the efficient set. J. Math. Anal. Appl. 98, 562–580 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  • Benson, H.P.: An algorithm for optimizing over the weakly-efficient set. Eur. J. Oper. Res. 25, 192–199 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  • Benson, H.P.: An all-linear programming relaxation algorithm for optimization over the efficient set. J. Glob. Optim. 1, 83–104 (1991)

    Article  MATH  Google Scholar 

  • Benson, H.P.: A bisection-extreme point search algorithm for optimizing over the efficient set in the linear dependance case. J. Glob. Optim. 3, 95–111 (1993)

    Article  MATH  Google Scholar 

  • Benson, H.P.: Concave minimization: theory, applications and algorithms. In: Horst, R., Pardalos, P. (eds.) Handbook of Global Optimization, pp. 43–148. Kluwer Academic Publishers, Dordrecht (1995)

    Chapter  Google Scholar 

  • Benson, H.P.: Deterministic algorithms for constrained concave minimization: a unified critical survey. Nav. Res. Logist. 43, 765–795 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  • Benson, H.P.: An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multi objective linear programming problem. J. Glob. Optim. 13, 1–24 (1998)

    Article  MATH  Google Scholar 

  • Benson, H.P.: An outcome space branch and bound outer approximation algorithm for convex multiplicative programming. J. Glob. Optim. 15, 315–342 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  • Benson, H.P.: A global optimization approach for generating efficient points for multiplicative concave fractional programming. J. Multicrit. Decis. Anal. 13, 15–28 (2006)

    Article  Google Scholar 

  • Bialas, W.F., Karwan, C.H.: On two-level optimization. IEEE Trans. Auto. Const. AC-27, 211–214 (1982)

    Article  MATH  Google Scholar 

  • Bolintineau, S.: Minimization of a quasi-concave function over an efficient set. Math. Program. 61, 83–120 (1993a)

    Google Scholar 

  • Bolintineau, S.: Optimality condition for minimization over the (weakly or properly) efficient set. J. Math. Anal. Optim. 173, 523–541 (1993b)

    Google Scholar 

  • Bracken, J., McGill, J.: Mathematical programs with optimization problems in the constraints. Oper. Res. 21, 37–44 (1973)

    Google Scholar 

  • Bracken, J., McGill, J.: A method for solving mathematical programs with nonlinear programs in the constraints. Oper. Res. 22, 1097–1101 (1974)

    Article  MathSciNet  MATH  Google Scholar 

  • Candler, W., Townsley, R.: A linear two-level programming problem. Comput. Oper. Res. 9, 59–76 (1982)

    Article  MathSciNet  Google Scholar 

  • Ecker, J.G., Song, H.G.: Optimizing a linear function over an efficient set. J. Optim. Theory Appl. 83, 541–563 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  • Floudas, C., et al.: Handbook of Test Problems for Local and Global Optimization. Kluwer, Dordrecht (1999)

    Book  Google Scholar 

  • Friesz, T.L., et al.: A simulated annealing approach to the network design problem with variational inequality constraints. Transp. Sci. 28, 18–26 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  • Fukushima, M.: Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems. Math. Program. 53, 99–110 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  • Hansen, P., Jaumard, B., Savard, G.: New branch and bound rules for linear bilinear programming. SIAM J. Sci. Stat. Comput. 13, 1194–1217 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  • Hartman, P., Stampacchia, G.: On some nonlinear elliptic differential functional equations. Acta Math. 115, 153–188 (1966)

    Article  MathSciNet  MATH  Google Scholar 

  • Luc, L.T.: Reverse polyblock approximation for optimization over the weakly efficient set and the efficient set. Acta Math. Vietnam. 26, 65–80 (2001)

    MathSciNet  MATH  Google Scholar 

  • Luo, Z.Q., Pang, J.S., Ralph, D.: Mathematical Programs with Equilibrium Constraints. Cambridge University Press, Cambridge, United Kingdom (1996)

    Book  MATH  Google Scholar 

  • Mastroeni, G.: Gap functions for equilibrium problems. J. Glob. Optim. 27, 411–426 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  • Migdalas, A., Pardalos, P.M., Värbrand, P. (eds): Multilevel Optimization: Algorithms and Applications. Kluwer, Dordrecht (1998)

    MATH  Google Scholar 

  • Muu, L.D., Tuyen, H.Q.: Bilinear programming approach to optimization over the efficient set of a vector affine fractional problem. Acta Math. Vietnam. 27, 119–140 (2002)

    MathSciNet  MATH  Google Scholar 

  • Outrata, J.V., Koc̆vara, M., Zowe, J.: Nonsmooth Approach to Optimization Problems with Equilibrium Constraints. Kluwer, Cambridge (1998)

    Google Scholar 

  • Philip, J.: Algorithms for the vector maximization problem. Math. Program. 2, 207–229 (1972)

    Article  MathSciNet  MATH  Google Scholar 

  • Shimizu, K., Ishizuka, Y., Bard, J.F.: Nondifferentiable and Two-Level Mathematical Programming. Kluwer, Cambridge (1997)

    Book  MATH  Google Scholar 

  • Thach, P.T., Konno, H., Yokota, D.: A dual approach to a minimization on the set of Pareto-optimal solutions. J. Optim. Theory Appl. 88, 689–701 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  • Tuy, H., Ghannadan, S.: A new branch and bound method for bilevel linear programs. In: Migdalas, A., Pardalos, P.M., Värbrand, P. (eds.) Multilevel Optimization: Algorithms and Applications, pp. 231–249. Kluwer, Dordrecht (1998)

    Chapter  Google Scholar 

  • Tuy, H., Hoai-Phuong, N.T.: Optimization under composite monotonic constraints and constrained optimization over the efficient set. In: Liberti, L., Maculan, N. (eds.) Global Optimization: From Theory to Implementation, pp. 3–32. Springer, Berlin/New York (2006)

    Chapter  Google Scholar 

  • Tuy, H., Migdalas, A., Väbrand, P.: A global optimization approach for the linear two-level program. J. Glob. Optim. 3, 1–23 (1992)

    Article  MathSciNet  Google Scholar 

  • Tuy, H., Dan, N.D., Ghannadan, S.: Strongly polynomial time algorithm for certain concave minimization problems on networks. Oper. Res. Lett. 14, 99–109 (1993a)

    Google Scholar 

  • Tuy, H., Migdalas, A., Väbrand, P.: A quasiconcave minimization method for solving linear two-level programs. J. Glob. Optim. 4, 243–263 (1994b)

    Google Scholar 

  • Tuy, H., Ghannadan, S., Migdalas, A., Värbrand, P.: Strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables. Math. Program. 72, 229–258 (1996a)

    Google Scholar 

  • Tuy, H., Thach, P.T., Konno, H., Yokota, D.: Dual approach to optimization on the set of pareto-optimal solutions. J. Optim. Theory Appl. 88, 689–707 (1996b)

    Google Scholar 

  • Vincent, J.F.: Structural Biomaterials. Princeton University Press, Princeton (1990)

    Google Scholar 

  • Vicentee, L., Savard, G., Judice, J.: Descent approaches for quadratic bilevel programming. J. Optim. Theory Appl. 81, 379–388 (1994)

    Google Scholar 

  • White, D.J., Annandalingam, G.: A penalty function approach for solving bilevel linear programs. J. Glob. Optim. 3, 397–419 (1993)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Vietnam Academy of Science and Technology, Institute of Mathematics, Hanoi, Vietnam

    Hoang Tuy

Authors
  1. Hoang Tuy
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this chapter

Cite this chapter

Tuy, H. (2016). Optimization Under Equilibrium Constraints. In: Convex Analysis and Global Optimization. Springer Optimization and Its Applications, vol 110. Springer, Cham. https://doi.org/10.1007/978-3-319-31484-6_13

Download citation

Publish with us

Policies and ethics

Search

Navigation