Sufficient Optimality and Sensitivity Analysis of a Parameterized Min-Max Programming
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...
Main Authors: | Huijuan Xiong, Yu Xiao, Chaohong Song |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2012-01-01
|
Series: | Journal of Applied Mathematics |
Online Access: | http://dx.doi.org/10.1155/2012/692325 |
Similar Items
-
A Deterministic Algorithm for Min-max and Max-min Linear Fractional Programming Problems
by: Qigao Feng, et al.
Published: (2011-04-01) -
The complexity of constrained min-max optimization
by: Daskalakis, Constantinos, et al.
Published: (2022) -
Min-max and max-min graph saturation parameters
by: S. Sudha, et al.
Published: (2020-09-01) -
Unifying View on Min-Max Fairness, Max-Min Fairness, and Utility Optimization in Cellular Networks
by: Holger Boche, et al.
Published: (2007-02-01) -
Unifying View on Min-Max Fairness, Max-Min Fairness, and Utility Optimization in Cellular Networks
by: Stanczak Slawomir, et al.
Published: (2007-01-01)