Approximate multiparametric sensitivity analysis of the constraint matrix in linear-plus-linear fractional programming problem (Q849776): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: reviewed by (P1447): Item:Q240126
RedirectionBot (talk | contribs)
Changed an Item
Property / reviewed by
 
Property / reviewed by: István Maros / rank
 
Normal rank

Revision as of 12:36, 11 February 2024

scientific article
Language Label Description Also known as
English
Approximate multiparametric sensitivity analysis of the constraint matrix in linear-plus-linear fractional programming problem
scientific article

    Statements

    Approximate multiparametric sensitivity analysis of the constraint matrix in linear-plus-linear fractional programming problem (English)
    0 references
    0 references
    0 references
    31 October 2006
    0 references
    The authors consider a linear-plus-linear fractional programming problem and presents an approximate parametric sensitivity analysis on it. The approximation is based on the approximate inverse of the perturbed matrix. Perturbation is quite general and may depend on several parameters. Parameters are classified as focal and nonfocal. The latter can be excluded from the analysis resulting in the reduction of the parameter space. For the focal parameters an approximate tolerance region is provided. The described method is illustrated by a numerical example.
    0 references
    sensitivity analysis
    0 references
    parametric programming
    0 references
    linear-plus-linear fractional programming
    0 references
    numerical example
    0 references
    0 references

    Identifiers