Advertisement

Complementarity Constraint Qualifications and Simplified B-Stationarity Conditions for Mathematical Programs with Equilibrium Constraints

  • Jong-Shi Pang
  • Masao Fukushima
Article

Abstract

With the aid of some novel complementarity constraint qualifications, we derive some simplified primal-dual characterizations of a B-stationary point for a mathematical program with complementarity constraints (MPEC). The approach is based on a locally equivalent piecewise formulation of such a program near a feasible point. The simplified results, which rely heavily on a careful dissection and improved understanding of the tangent cone of the feasible region of the program, bypass the combinatorial characterization that is intrinsic to B-stationarity.

mathematical programs with equilibrium constraints stationarity conditions 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    J. Abadie, “On the Kuhn-Tucker theorem,” in Nonlinear Programming, J. Abadie (Ed.), North Holland Publishing Company: Amsterdam, 1967, pp. 19-36.Google Scholar
  2. 2.
    R.W. Cottle, J.S. Pang, and R.E. Stone, The Linear Complementarity Problem, Academic Press: Boston, 1992.Google Scholar
  3. 3.
    R.W. Cottle, J.S. Pang, and V. Venkateswaran, “Sufficient matrices and the linear complementarity problem,” Linear Algebra and its Applications, vols. 114/115, pp. 231-249, 1989.Google Scholar
  4. 4.
    F. Facchinei, H. Jiang, and L. Qi, “A smoothing method for mathematical programs with equilibrium constraints,” Mathematical Programming, in press.Google Scholar
  5. 5.
    J.E. Falk and J. Liu, “On bilevel programming, Part I: General nonlinear case,” Mathematical Programming, vol. 70, pp. 47-72, 1995.Google Scholar
  6. 6.
    M. Fukushima, Z.Q. Luo, and J.S. Pang, “A globally convergent sequential quadratic programming algorithm for mathematical programs with linear complementarity constraints,” Computational Optimization and Applications, vol. 10, pp. 5-30, 1998.Google Scholar
  7. 7.
    M. Fukushima and J.S. Pang, “Some feasibility issues in mathematical programs with equilibrium constraints,” SIAM Journal of Optimization, vol. 8, pp. 673-681, 1998.Google Scholar
  8. 8.
    O. Güler and Y. Ye, “Convergence behavior of interior-point algorithms,” Mathematical Programming, vol. 60, pp. 215-228, 1993.Google Scholar
  9. 9.
    H. Jiang and D. Ralph, “QPECgen, a MATLAB generator for mathematical programs with quadratic objectives and affine variational inequality constraints,” Comp. Optimiz. and Applic., vol. 13, pp. 25-60, 1998.Google Scholar
  10. 10.
    Z.Q. Luo, J.S. Pang, and D. Ralph, Mathematical Programs with Equilibrium Constraints, Cambridge University Press: Cambridge, 1996.Google Scholar
  11. 11.
    Z.Q. Luo, J.S. Pang, and D. Ralph, “Piecewise sequential quadratic programming for mathematical programs with nonlinear complementarity constraints,” in Multilevel Optimization: Algorithms, Complexity and Applications, A. Migdalas and P. Pardalos (Eds.), Kluwer Academic Publishers, 1998, pp. 209-230.Google Scholar
  12. 12.
    Z.-Q. Luo, J.S. Pang, D. Ralph, and S.Q. Wu, “Exact penalization and stationary conditions of mathematical programs with equilibrium constraints,” Mathematical Programming, vol. 76, pp. 19-76, 1996.Google Scholar
  13. 13.
    O.L. Mangasarian, Nonlinear Programming, SIAM Classics in Applied Mathematics 10, Philadelphia, 1994.Google Scholar
  14. 14.
    O.L. Mangasarian and S. Fromovitz, “The Fritz John optimality necessary conditions in the presence of equality and inequality constraints,” Journal of Mathematical Analysis and Applications, vol. 17, pp. 37-47, 1967.Google Scholar
  15. 15.
    J.V. Outrata, “On optimization problems with variational inequality constraints,” SIAM Journal of Optimization, vol. 4, pp. 340-357, 1994.Google Scholar
  16. 16.
    J.V. Outrata, “Optimization conditions for a class of mathematical programs with equilibrium constraints,” manuscript, Institute of Information Theory and Automation, Academy of Sciences of the Czech Republic, Prague, revised October 1997.Google Scholar
  17. 17.
    D. Ralph, “Sequential quadratic programming for mathematical programs with linear complementarity constraints,” in CTAC95 Computational Techniques and Applications, R.L. May and A.K. Eastons (Eds.), World Scientific Press, 1996, pp. 663-668.Google Scholar
  18. 18.
    H. Scheel and S. Scholtes, “Mathematical programs with equilibrium constraints: Stationarity, optimality, and sensitivity,” preprint, University of Cambridge, Department of Engineering & The Judge Institute of Management Studies, Cambridge, September 1997.Google Scholar
  19. 19.
    J. Stoer and C. Witzgall, Convexity and Optimization in Finite Dimensions I, Spring-Verlag: Berlin, Heidelberg, 1970.Google Scholar
  20. 20.
    J.J. Ye, “Optimality conditions for optimization problems with complementarity constraints,” manuscript, Department of Mathematics and Statistics, University of Victoria, Victoria, October 1997.Google Scholar
  21. 21.
    Y. Ye, private communication, January 1998.Google Scholar
  22. 22.
    J.J. Ye and X.Y. Ye, “Necessary optimality conditions for optimization problems with variational inequalities constraints,” Mathematics of Operations Research, vol. 22, pp. 977-998, 1997.Google Scholar
  23. 23.
    J.J. Ye and D.L. Zhu, “Optimality conditions for bilevel programming problems,” Optimization, vol. 33, pp. 9-27, 1995.Google Scholar
  24. 24.
    A. Yezza, “First-order necessary optimality conditions for general bilevel programming problems,” Journal of Optimization Theory and Applications, vol. 89, pp. 189-219, 1996.Google Scholar
  25. 25.
    R. Zhang, “Problems of hierarchical optimization in finite dimensions,” SIAM Journal on Optimization, vol. 4, pp. 521-536, 1994.Google Scholar

Copyright information

© Kluwer Academic Publishers 1999

Authors and Affiliations

  • Jong-Shi Pang
    • 1
  • Masao Fukushima
    • 2
  1. 1.The Johns Hopkins UniversityBaltimoreUSA
  2. 2.Department of Applied Mathematics and PhysicsGraduate School of Informatics, Kyoto UniversityKyotoJapan

Personalised recommendations