Maximizing a linear fractional function on a Pareto efficient frontier
From MaRDI portal
Publication:700704
DOI10.1023/A:1014857230393zbMath1027.90096OpenAlexW1507025074MaRDI QIDQ700704
Publication date: 8 October 2002
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1014857230393
Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Sensitivity, stability, parametric optimization (90C31) Fractional programming (90C32)
Related Items (4)
An efficiency measurement framework for multi-stage production systems ⋮ A new scheme for approximating the weakly efficient solution set of vector rational optimization problems ⋮ Approximating the Pareto set of multiobjective linear programs via robust optimization ⋮ A sixth bibliography of fractional programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Measuring the efficiency of decision making units
- Minimization of a quasi-concave function over an efficient set
- Bicriteria linear fractional programming
- Parametric simplex algorithms for solving a special class of nonconvex minimization problems
- An all-linear programming relaxation algorithm for optimizing over the efficient set
- Connectedness of the efficient set of strictly quasiconcave sets
- An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
- Finding all maximal efficient faces in multiobjective linear programming
- Image space analysis of generalized fractional programs
- Connectedness of the efficient set in strictly quasiconcave vector maximization
- Utility function programs and optimization over the efficient set in multiple-objective decision making
- Connectedness of the efficient set for three-objective quasiconcave maximization problems
- Branch-and-bound variant of an outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem
- Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem
- On the connectedness of the efficient set for strictly quasiconvex vector minimization problems
- Generalized linear multiplicative and fractional programming
- Parametric Solution of Bicriterion Linear Fractional Programs
- On Maximizing a Sum of Ratios
- Optimizing Over the Efficient Set Using a Top-Down Search of Faces
- Programming with linear fractional functionals
- Solving Bicriterion Mathematical Programs
- Optimization over the efficient set
This page was built for publication: Maximizing a linear fractional function on a Pareto efficient frontier
