sufficient optimality and sensitivity analysis of a parameterized min-max programming

Clicks: 83
ID: 234696
2012
Free PDF
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This article has not been analysed, so there is no overall score — reader engagement is measured and shown alongside.
AI Quality Assessment
Not analyzed
Readership in this journal
Steady

Ranked #225 of 357 articles by views in Chemico-biological interactions

Most read Least read

Bar heights use a square-root scale. Only the 120 most-read articles are drawn; the journal has 357 in total.

Mint this article as an NFT
Not yet minted

Create a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.

5 SUSD one-off · no wallet required
Sign in to mint
Abstract
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.
Reference Key
xiong2012journalsufficient Use this key to autocite in the manuscript while using SciMatic Manuscript Manager or Thesis Manager
Authors ;Huijuan Xiong;Yu Xiao;Chaohong Song
Journal Chemico-biological interactions
Year 2012
DOI
10.1155/2012/692325
URL
http://dx.doi.org/10.1155/2012/692325
Keywords
mathematics

Citations

No citations found. To add a citation, contact the admin at info@scimatic.org

Comments

No comments yet. Be the first to comment on this article.