Sufficient Optimality and Sensitivity Analysis of a Parameterized Min-Max Programming

Abstract EN

Sufficient optimality and sensitivity of a parameterized min-max programming with fixed feasible set are analyzed.

Based on Clarke's subdifferential and Chaney's second-order directional derivative, sufficient optimality of the parameterized min-max programming is discussed first.

Moreover, under a convex assumption on the objective function, a subdifferential computation formula of the marginal function is obtained.

The assumptions are satisfied naturally for some application problems.

Moreover, the formulae based on these assumptions are concise and convenient for algorithmic purpose to solve the applications.