Branch-and-bound variant of an outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem
type: Item
instance of: scholarly article
title: Branch-and-bound variant of an outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem
zbMATH Open document ID: 1028.90027
DOI: 10.1023/A:1004657827134
author: Le Dung Muu
author: János Fülöp
published in: Journal of Optimization Theory and Applications
publication date: 2004-01-27T00:00:00Z
Mathematics Subject Classification ID: 90C08
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90C29
zbMATH DE Number: 1506896
zbMATH Keywords: multiple-criteria decision making
zbMATH Keywords: efficient set
zbMATH Keywords: global optimization
zbMATH Keywords: branch-and-bound methods
MaRDI profile type: Publication
cites work: Linear multiobjective programming
cites work: Q3716769
cites work: Q4001824
cites work: Interactive multiple objective optimization: Survey. I: Continuous case
cites work: Analysis of the objective space in multiple objective linear programming
cites work: On degeneracy and collapsing in the construction of the set of objective values in a multiple objective linear program
cites work: Solving multiple objective linear programs in objective space
cites work: Constructing the set of efficient objective values in multiple objective linear programs
cites work: A geometrical analysis of the efficient outcome set in multiple objective convex programs with linear criterion functions
cites work: A representation of an efficiency equivalent polyhedron for the objective set of a multiple objective linear program
cites work: A combined constraint-space, objective-space approach for determining high-dimensional maximal efficient faces of multiple objective linear programs
cites work: An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
cites work: Hybrid approach for solving multiple-objective linear programs in outcome space
cites work: Solving Bicriterion Mathematical Programs
cites work: On the characterization of Pareto-optimal solutions in bicriterion optimization
cites work: Vector maximization with two objective functions
cites work: An algorithm for bicriterion linear programming
cites work: Bicriteria Transportation Problem
cites work: Approximating the noninferior set in linear biobjective programs using multiparametric decomposition
cites work: Generating the efficient outcome set in multiple objective linear programs: The bicriteria case
cites work: An Interactive Method as an Aid in Solving Bicriterion Mathematical Programming Problems
cites work: A multi-run interactive method for bicriterion optimization problems
cites work: Algorithms for the vector maximization problem
cites work: Optimization over the efficient set
cites work: An all-linear programming relaxation algorithm for optimizing over the efficient set
cites work: Optimization over the efficient set using an active constraint approach
cites work: A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set
cites work: A bisection-extreme point search algorithm for optimizing over the efficient set in the linear dependence case
cites work: Q4695784
cites work: Minimization of a quasi-concave function over an efficient set
cites work: Optimization over the efficient set: Four special cases
cites work: Optimizing a linear function over an efficient set
cites work: Lagrangian duality of concave minimization subject to linear constraints and an additional facial reverse convex constraint
cites work: The maximization of a function over the efficient set via a penalty function approach
cites work: Computational aspects of optimization problems over the efficient set
cites work: Numerical solution for optimization over the efficient set by d.c. optimization algorithms
cites work: Dual approach to minimization on the set of Pareto-optimal solutions
cites work: Utility function programs and optimization over the efficient set in multiple-objective decision making
cites work: Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem
cites work: A parametric simplex method for optimizing a linear function over the efficient set of bicriteria linear problem
cites work: Q4287997
cites work: Complete efficiency and the initialization of algorithms for multiple objective programming
full work available at URL: a:1004657827134
OpenAlex ID: W200655828
description: scientific article; zbMATH DE number 1506896