Optimality conditions for mathematical programs with equilibrium constraints using directional convexificators

References

• Baumrucker TB, Renfro GJ, Biegler TL. MPEC problem formulations and solution strategies with chemical engineering applications. Comput Chem Eng. 2008;32:2903–2913.
   Web of Science ®Google Scholar
• Luo ZQ, Pang JS, Ralph D. Mathematical programs with equilibrium constraints. Cambridge: Cambridge Univ. press; 1996.
   Google Scholar
• Raghunathan UA, Diaz SM, Biegler TL. An MPEC formulation for dynamic optimization of distillation operations. Comput Chem Eng. 2008;28:2037–2052.
   Google Scholar
• Flegel ML, Kanzow C. On the Guignard constraint qualification for mathematical programswith equilibrium constraints. Optimization. 2005;54:517–534.
   Web of Science ®Google Scholar
• Flegel ML, Kanzow C. A Fritz John approach to first order optimality conditions for mathematical programs with equilibrium constraints. Optimization. 2003;5:277–286.
   Google Scholar
• Outrata JV. Optimality conditions for a class of mathematical programs with equilibrium constraints. Math Oper Res. 1999;24:627–644.
   Web of Science ®Google Scholar
• Flegel ML, Kanzow C. Abadie-Type constraint qualification for mathematical programs with equilibrium constraints. J Optim Theory App. 2005;124:595–614.
   Web of Science ®Google Scholar
• Flegel ML, Kanzow C, Outrata VJ. Optimality conditions for disjunctive programs with applications to mathematicalprograms with equilibrium constraints. Set-Valued Anal. 2007;15:139–162.
   Google Scholar
• Movahedian N, Nobakhtian S. Constraint qualifications for nonsmooth mathematical programs with equilibrium constraints. Set Valued Anal. 2009;17:63–95.
   Web of Science ®Google Scholar
• Movahedian N, Nobakhtian S. Necessary and sufficient conditions for nonsmooth mathematical programs with equilibrium constraints. Nonlinear Anal. 2010;72:2694–2705.
   Web of Science ®Google Scholar
• Scheel H, Scholtes S. Mathematical programs with complementarity constraints: stationarity, optimality and sensitivity. Math Oper Res. 2000;25:1–22.
   Web of Science ®Google Scholar
• Ye JJ. Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints. J Math Anal App. 2005;307:350–369.
   Web of Science ®Google Scholar
• Demyanov VF, Jeyakumar V. Hunting for a smaller convex subdifferential. J Glob Optim. 1997;10:305–326.
   Web of Science ®Google Scholar
• Demyanov VF. Convexification and concavification of a positively homogenous function by the same family of linear functions. Universita di Pisa; 1994. Report (3, 208, 802).
   Google Scholar
• Jeyakumar V, Luc DT. Approximate Jacobian matrices for nonsmooth continuous maps and C1-optimization. SIAM J Control Optim. 1998;36:1815–1832.
   Web of Science ®Google Scholar
• Jeyakumar V, Luc DT. Nonsmooth calculus, maximality and monotonicity of convexificators. J Optim Theory Appl. 1999;101:599–621.
   Web of Science ®Google Scholar
• Dutta J, Chandra S. convexificators, generalized convexity and optimality conditions. J Optim Theory Appl. 2002;113:41–65.
   Web of Science ®Google Scholar
• Ansari Ardalia AA, Movahediana N, Nobakhtianab S. Optimality conditions for nonsmooth mathematical programs with equilibrium constraints, using convexificators. Optimization. 2016;65:67–85.
   Web of Science ®Google Scholar
• Dempe S, Pilecka M. Necessary optimality conditions for optimistic bilevel programming problems using set-valued programming. J Global Optim. 2015;61:769–788.
   Web of Science ®Google Scholar
• Lafhim L, Gadhi N, Hamdaoui K, et al. Necessary optimality conditions for a bilevel multiobjective programming problem via a Ψ-reformulation. Optimization. 2018;67:1–11.
   PubMed Web of Science ®Google Scholar
• Pandey Y, Mishra SK. Optimality conditions and duality for semi-infinite mathematical programming problems with equilibrium constraints, using convexificators. Ann Oper Res. 2018;269:549–564.
   Web of Science ®Google Scholar
• Ewing GM. Sufficient conditions for global minima of suitably convex functionals from variational and control theory. SIAM Rev. 1977;19:202–220.
   Web of Science ®Google Scholar
• Kaur S. Theorical studies in mathematical programming [PhD thesis]. University of Delhi; 1983.
   Google Scholar
• Kabgani A, Soleimani-damaneh M. Constraint qualifications and optimality conditions in nonsmooth locally star-shaped optimization using convexificators. Pacific J Optim. 2019;15:399–413.
   Web of Science ®Google Scholar
• Clarke FC. Optimization and nonsmooth analysis. New York: Wiley-Interscience; 1983.
   Google Scholar
• Hiriart-Urruty JB, Lemarechal C. Fundamentals of convex analysis. Berlin (HD): Springer-Verlag; 2001.
   Google Scholar
• Aussel D, Ye JJ. Quasiconvex programming with locally star-shaped constraint region and applications to quasiconvex MPEC. Optimization. 2006;55:433–457.
   Web of Science ®Google Scholar