Maximizing a linear fractional function on a Pareto efficient frontier

DOI10.1023/A:1014857230393zbMATH Open1027.90096OpenAlexW1507025074MaRDI QIDQ700704FDOQ700704

Ury Passy, Steven T. Hackman

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

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

zbMATH Keywords

nonconvex optimizationefficient frontierapplication of sensitivity analysisFractional programming

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Fractional programming (90C32) Nonconvex programming, global optimization (90C26) Sensitivity, stability, parametric optimization (90C31)

Cites Work

• Programming with linear fractional functionals
• Measuring the efficiency of decision making units
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Solving Bicriterion Mathematical Programs
• Parametric simplex algorithms for solving a special class of nonconvex minimization problems
• Title not available (Why is that?)
• Bicriteria linear fractional programming
• Image space analysis of generalized fractional programs
• Optimization over the efficient set
• Optimizing Over the Efficient Set Using a Top-Down Search of Faces
• 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
• An all-linear programming relaxation algorithm for optimizing over the efficient set
• Utility function programs and optimization over the efficient set in multiple-objective decision making
• Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem
• Generalized linear multiplicative and fractional programming
• Minimization of a quasi-concave function over an efficient set
• Connectedness of the efficient set for three-objective quasiconcave maximization problems
• Connectedness of the efficient set of strictly quasiconcave sets
• Connectedness of the efficient set in strictly quasiconcave vector maximization
• Branch-and-bound variant of an 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
• Parametric Solution of Bicriterion Linear Fractional Programs
• On Maximizing a Sum of Ratios
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (4)

• An efficiency measurement framework for multi-stage production systems
• Approximating the Pareto set of multiobjective linear programs via robust optimization
• A sixth bibliography of fractional programming
• A new scheme for approximating the weakly efficient solution set of vector rational optimization problems

Uses Software

• DEA

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)