Optimization over the efficient set of a parametric multiple objective linear programming problem
type: Item
instance of: scholarly article
title: Optimization over the efficient set of a parametric multiple objective linear programming problem
zbMATH Open document ID: 0961.90105
DOI: 10.1016/S0377-2217(99)00095-8
author: Ta Van Tu
published in: European Journal of Operational Research
publication date: 2000-08-30T00:00:00Z
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C31
Mathematics Subject Classification ID: 90C08
zbMATH DE Number: 1498192
zbMATH Keywords: parametric multiple objective linear programming
zbMATH Keywords: nonlinear programming
zbMATH Keywords: efficiency
zbMATH Keywords: decision theory
MaRDI profile type: Publication
cites work: Optimization over the efficient set
cites work: An algorithm for optimizing over the weakly-efficient set
cites work: An all-linear programming relaxation algorithm for optimizing over the efficient set
cites work: A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set
cites work: Finding an Initial Efficient Extreme Point for a Linear Multiple Objective Program
cites work: Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem
cites work: Q4695784
cites work: Optimization over the efficient set: Four special cases
cites work: Minimization of a quasi-concave function over an efficient set
cites work: Q3844775
cites work: Optimization over the efficient set using an active constraint approach
cites work: On Computing an Initial Efficient Extreme Point
cites work: Generating all maximal efficient faces for multiple objective linear programs
cites work: Finding all efficient extreme points for multiple objective linear programs
cites work: A revised simplex method for linear multiple objective programs
cites work: Q4039786
cites work: Q4296848
cites work: A general method for determining the set of all efficient solutions to a linear vectormaximum problem
cites work: Utility function programs and optimization over the efficient set in multiple-objective decision making
cites work: Q3997222
cites work: The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
cites work: Computational experience concerning payoff tables and minimum criterion values over the efficient set
cites work: Finding all vertices of a convex polyhedron
cites work: A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
cites work: Algorithms for the vector maximization problem
cites work: Q3815146
cites work: Q4382120
cites work: Careful usage of pessimistic values is needed in multiple objectives optimization
cites work: The maximization of a function over the efficient set via a penalty function approach
cites work: The set of all nondominated solutions in linear cases and a multicriteria simplex method
cites work: Q3277015
description: scientific article; zbMATH DE number 1498192