Sufficient optimality and sensitivity analysis of a parameterized min-max programming (Q1760808): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q616791 |
Changed an Item |
||
Property / author | |||
Property / author: Hui-juan Xiong / rank | |||
Normal rank |
Revision as of 07:35, 20 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Sufficient optimality and sensitivity analysis of a parameterized min-max programming |
scientific article |
Statements
Sufficient optimality and sensitivity analysis of a parameterized min-max programming (English)
0 references
15 November 2012
0 references
Summary: 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.
0 references
sufficient optimality
0 references
sensitivity
0 references
parameterized min-max programming
0 references