2022OptimizationRequires access

Mangasarian-type second- and higher-order duality for mathematical programs with complementarity constraints

Qiulin Zhang, Huiling Lin

Open publisher page 2 citations

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.

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Strong duality, Duality (order theory), Wolfe duality, Mathematics, Converse, Dual polyhedron, Weak duality, Duality gap

Related papers

Back to paper searchBrowse research topicsOriginal source
Mangasarian-type second- and higher-order duality for mathematical programs with complementarity constraints — Research Paper | ScholarLens