sensitivity analysis in piecewise linear fractional programming problem with non-degenerate optimal solution
Clicks: 132
ID: 210445
2009
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.
Reader Engagement
Steady Performance
30.0
/100
132 views
26 readers
AI Quality Assessment
Not analyzed
Readership in this journal
SteadyRanked #71 of 95 articles by views in zhonghua yi xue za zhi
Most read
Least read
Bar heights use a square-root scale.
Mint this article as an NFT
Not yet mintedCreate 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.
10
SUSD
one-off · no wallet required
Abstract
In this paper, we study how changes in the coefficients of objective function and the right-hand-side vector of constraints of the piecewise linear fractional programming problems affect the non-degenerate optimal solution. We consider separate cases when changes occur in different parts of the problem and derive bounds for each perturbation, while the optimal solution is invariant. We explain that this analysis is a generalization of the sensitivity analysis for \(LP\), \(LFP\) and \(PLP\). Finally, the results are described by some numerical examples.
| Reference Key |
kheirfam2009opusculasensitivity
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | ;Behrouz Kheirfam |
| Journal | zhonghua yi xue za zhi |
| Year | 2009 |
| DOI |
http://dx.doi.org/10.7494/OpMath.2009.29.3.253
|
| URL | |
| Keywords |
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.