Maximizing a linear fractional function on a Pareto efficient frontier
From MaRDI portal
Publication:700704
Recommendations
- Generating the efficient frontier of a class of bicriteria generalized fractional programming
- scientific article; zbMATH DE number 3982936
- An algorithm for two-criterion linear fractional programming.
- Technical Note—Proper Efficiency and the Linear Fractional Vector Maximum Problem
- A computationally efficient algorithm to approximate the Pareto front of multi-objective linear fractional programming problem
Cites work
- scientific article; zbMATH DE number 417962 (Why is no real title available?)
- scientific article; zbMATH DE number 3458411 (Why is no real title available?)
- scientific article; zbMATH DE number 592650 (Why is no real title available?)
- scientific article; zbMATH DE number 3797518 (Why is no real title available?)
- scientific article; zbMATH DE number 757682 (Why is no real title available?)
- scientific article; zbMATH DE number 920120 (Why is no real title available?)
- scientific article; zbMATH DE number 3225772 (Why is no real title available?)
- An all-linear programming relaxation algorithm for optimizing over the efficient set
- An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
- Bicriteria linear fractional programming
- Branch-and-bound variant of an outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem
- Connectedness of the efficient set for three-objective quasiconcave maximization problems
- Connectedness of the efficient set in strictly quasiconcave vector maximization
- Connectedness of the efficient set of strictly quasiconcave sets
- Finding all maximal efficient faces in multiobjective linear programming
- Generalized linear multiplicative and fractional programming
- Image space analysis of generalized fractional programs
- Measuring the efficiency of decision making units
- Minimization of a quasi-concave function over an efficient set
- On Maximizing a Sum of Ratios
- On the connectedness of the efficient set for strictly quasiconvex vector minimization problems
- Optimization over the efficient set
- Optimizing Over the Efficient Set Using a Top-Down Search of Faces
- Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem
- Parametric Solution of Bicriterion Linear Fractional Programs
- Parametric simplex algorithms for solving a special class of nonconvex minimization problems
- Programming with linear fractional functionals
- Solving Bicriterion Mathematical Programs
- Utility function programs and optimization over the efficient set in multiple-objective decision making
Cited in
(5)- Approximating the Pareto set of multiobjective linear programs via robust optimization
- A sixth bibliography of fractional programming
- An efficiency measurement framework for multi-stage production systems
- A computationally efficient algorithm to approximate the Pareto front of multi-objective linear fractional programming problem
- A new scheme for approximating the weakly efficient solution set of vector rational optimization problems
This page was built for publication: Maximizing a linear fractional function on a Pareto efficient frontier
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q700704)
