An iterative method for solving linear fraction programming (LFP) problem with sensitivity analysis

DOI10.3390/mca13030147zbMath1172.90017OpenAlexW2414479875MaRDI QIDQ1011914

S. F. Tantawy

Publication date: 14 April 2009

Published in: Mathematical \& Computational Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/mca13030147

zbMATH Keywords

sensitivity analysislinear fraction program

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Fractional programming (90C32) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items (1)

A branch-bound cut technique for non-linear fractional multi-objective optimization problems

This page was built for publication: An iterative method for solving linear fraction programming (LFP) problem with sensitivity analysis