Mangasarian-type second- and higher-order duality for mathematical programs with complementarity constraints
Qiulin Zhang, Huiling Lin
Abstract
Qiulin Zhang, Huiling Lin
Abstract
Based on the strong stationary condition, we formulate second-order and higher order duals for a mathematical program with complementary constraints (MPCC). Under suitable generalized convexity assumptions, we then propose several duality theorems for second and higher order duality in MPCC problems, including the weak duality, strong duality, converse duality, and strict converse duality theorems. Moreover, we present examples to illustrate these results, where one of them reveals that a lower bound provided by our proposed second-order duality is tighter than the one given by the first-order duality.
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Based on the strong stationary condition, we formulate second-order and higher order duals for a mathematical program with complementary constraints (MPCC). Under suitable generalized convexity assumptions, we then propose several duality theorems for second and higher order duality in MPCC problems, including the weak duality, strong duality, converse duality, and strict converse duality theorems. Moreover, we present examples to illustrate these results, where one of them reveals that a lower bound provided by our proposed second-order duality is tighter than the one given by the first-order duality.
Key concepts: Strong duality, Duality (order theory), Wolfe duality, Mathematics, Converse, Dual polyhedron, Weak duality, Duality gap