Optimizing Over the Efficient Set Using a Top-Down Search of Faces

DOI10.1287/OPRE.48.1.65.12449MaRDI QIDQ4530637zbMATH OpenOpenAlexFDO

Authors Serpil Sayın

Publication date 4 June 2002

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.48.1.65.12449

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Cited in

(20)

• A Criterion Space Branch-and-Cut Algorithm for Mixed Integer Bilinear Maximum Multiplicative Programs
• Filtering Algorithms for Biobjective Mixed Binary Linear Optimization Problems with a Multiple-Choice Constraint
• Maximizing a linear fractional function on a Pareto efficient frontier
• A criterion space search algorithm for mixed integer linear maximum multiplicative programs: a multiobjective optimization approach
• Solving bilevel linear programs using multiple objective linear programming
• A bilinear algorithm for optimizing a linear function over the efficient set of a multiple objective linear programming problem
• A new method for optimizing a linear function over the efficient set of a multiobjective integer program
• An improved algorithm to compute the \(\omega\)-primality
• The augmented weighted Tchebychev norm for optimizing a linear function over an integer efficient set of a multicriteria linear program
• Biobjective robust optimization over the efficient set for Pareto set reduction
• Parallel optimization over the integer efficient set
• Connections between single-level and bilevel multiobjective optimization
• Minimal representations of a face of a convex polyhedron and some applications
• Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs
• Exact solution approaches for integer linear generalized maximum multiplicative programs through the lens of multi-objective optimization
• Computing the nadir point for multiobjective discrete optimization problems
• A linear fractional optimization over an integer efficient set
• Optimizing over the properly efficient set of convex multi-objective optimization problems
• A New Exact Algorithm to Optimize a Linear Function over the Set of Efficient Solutions for Biobjective Mixed Integer Linear Programs
• An algorithm for optimizing a linear function over an integer efficient set

This page was built for publication: Optimizing Over the Efficient Set Using a Top-Down Search of Faces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4530637)