Constraint Qualifications and KKT Conditions for Bilevel Programming Problems

Published Online:https://doi.org/10.1287/moor.1060.0219

References

  • Abadie J. M., Abadie J. On the Kuhn-Tucker theorem. Nonlinear Programming (1967) (John Wiley, New York) 21–36Google Scholar
  • Arrow K. J., Hurwicz L., Uzawa H.Studies in Linear and Nonlinear Programming (1958) (Stanford University Press, Stanford, CA) Google Scholar
  • Aubin J.-P., Frankowska H.Set-Valued Analysis (1990) (Birkhäuser, Boston, MA) Google Scholar
  • Bard J. F.Practical Bilevel Optimization: Algorithms and Applications (1998) (Kluwer Academic Publications, Dordrecht, The Netherlands) CrossrefGoogle Scholar
  • Bard J. F., Falk J. E. An explicit solution to the multilevel programming problem. Comput. Oper. Res. (1982) 9:77–100CrossrefGoogle Scholar
  • Bazaraa M. S., Sherali H. D., Shetty C. M.Nonlinear Programming Theory and Algorithms (1993) 2nd ed.(John Wiley & Sons, New York) Google Scholar
  • Bracken J., McGill J. Mathematical programs with optimization problems in the constraints. Oper. Res. (1973) 21:37–44LinkGoogle Scholar
  • Clarke F. H.Optimization and Nonsmooth Analysis (1983) (Wiley-Interscience, New York) Google Scholar
  • Dempe S. A necessary and sufficient optimality condition for bilevel programming problems. Optimization (1992) 25:341–354CrossrefGoogle Scholar
  • Dempe S.Foundations of Bilevel Programming (2002) (Kluwer Academic Publishers, Dordrecht, The Netherlands) Google Scholar
  • Dempe S. Annotated bibliography on bilevel programming and mathematical programs with equilibrium constraints. Optimization (2003) 52:333–359CrossrefGoogle Scholar
  • Fiacco A. V., Kyparisis J. Convexity and concavity properties of the optimal value function in parametric nonlinear programming. J. Optim. Theory Appl. (1986) 48:95–126CrossrefGoogle Scholar
  • Gauvin J., Dubeau F. Differentiable properties of the marginal function in mathematical programming. Math. Programming Stud. (1982) 19(North-Holland, Amsterdam, The Netherlands) 101–119Google Scholar
  • Jourani A. Constraint qualifications and Lagrange multipliers in nondifferentiable programming problems. J. Optim. Theory Appl. (1994) 81:533–548CrossrefGoogle Scholar
  • Kuhn H. W., Tucker A. W., Neyman J. Nonlinear programming. Proc. Second Berkeley Sympos. Math. Statist. Probab. (1951) (University of California Press, Berkeley, CA) 481–492Google Scholar
  • Lucet Y., Ye J. J. Sensitivity analysis of the value function for optimization problems with variational inequality constraints. SIAM J. Control Optim. (2001) 40:699–723CrossrefGoogle Scholar
  • Lucet Y., Ye J. J. Erratum: Sensitivity analysis of the value function for optimization problems with variational inequality constraints. SIAM J. Control Optim. (2002) 41:1315–1319CrossrefGoogle Scholar
  • Luo Z. Q., Pang J. S., Ralph D.Mathematical Programs with Equilibrium Constraints (1996) (Cambridge University Press, Cambridge, UK) CrossrefGoogle Scholar
  • Mangasarian O. L.Nonlinear Programming (1994) (SIAM, Philadelphia, PA) . (Originally published by McGraw-Hill, New York, 1969.)CrossrefGoogle Scholar
  • Outrata J. V. Necessary optimality conditions for Stackelberg problems. J. Optim. Theory Appl. (1990) 76:305–320CrossrefGoogle Scholar
  • Outrata J. V., Kočvara M., Zowe J.Nonsmooth Approach to Optimization Problem with Equilibrium Constraints: Theory, Application and Numerical Results (1998) (Kluwer, Dordrecht, The Netherlands) CrossrefGoogle Scholar
  • Pang J. S., Fukushima M. Complementarity constraint qualifications and simplified B-stationary conditions. Comput. Optim. Appl. (1999) 13:111–136CrossrefGoogle Scholar
  • Penot J.-P., Crouzeix Jean-Pierre, Volle Michel, Martinez-Legaz Juan-Enrique. Are generalized derivatives useful for generalized convex functions? Generalized Convexity, Generalized Monotonicity: Recent Results (1998) (Kluwer Academic Publishers, Dordrecht, The Netherlands) 3–59CrossrefGoogle Scholar
  • Rockafellar R. T.Convex Analysis (1970) (Princeton University Press, Princeton, NJ) CrossrefGoogle Scholar
  • Rockafellar R. T., Wets R. J.-B.Variational Analysis (1998) (Springer, Berlin, Germany) CrossrefGoogle Scholar
  • Scheel H., Scholtes S. Mathematical programs with complementarity constraints: Stationarity, optimality and sensitivity. Math. Oper. Res. (2000) 25:1–22LinkGoogle Scholar
  • Shimizu K., Ishizuka Y., Bard J. F.Nondifferentiable and Two-Level Mathematical Programming (1997) (Kluwer Academic Publishers, Boston, MA) CrossrefGoogle Scholar
  • Vincente L. N., Calamai P. H. Bilevel and multilevel programming: A bibliography review. J. Global Optim. (1994) 5:291–306CrossrefGoogle Scholar
  • von Stackelberg H.Marktform and Gleichgewicht (1954) (Springer-Verlag, Berlin) . 1934. Engl. transl.: The Theory of the Market Economy Oxford University Press, Oxford, UKGoogle Scholar
  • Ye J. J. Constraint qualifications and necessary optimality conditions for optimization problems with variational inequality constraints. SIAM J. Optim. (2000) 10:943–962CrossrefGoogle Scholar
  • Ye J. J. Nondifferentiable multiplier rules for optimization and bilevel optimization problems. SIAM J. Optim. (2004) 15:252–274CrossrefGoogle Scholar
  • Ye J. J. Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints. J. Math. Anal. Appl. (2005) 307:305–369CrossrefGoogle Scholar
  • Ye J. J., Zhu D. L. Optimality conditions for bilevel programming problems. Optimization (1995) 33:9–27CrossrefGoogle Scholar
  • Ye J. J., Zhu D. L. A note on optimality conditions for bilevel programming problems. Optimization (1997) 39:361–366CrossrefGoogle Scholar
  • Ye J. J., Zhu D. L., Zhu Q. J. Exact penalization and necessary optimality conditions for generalized bilevel programming problems. SIAM J. Optim. (1997) 2:481–507CrossrefGoogle Scholar
  • Zangwill W. I.Nonlinear Programming: A Unified Approach (1969) (Prentice-Hall, Englewood Cliffs, NJ) Google Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.