Constructing efficient solutions structure of multiobjective linear programming
type: Item
instance of: scholarly article
title: Constructing efficient solutions structure of multiobjective linear programming
zbMATH Open document ID: 1066.90121
author: Hong Yan
author: Quanling Wei
author: Jun Wang
published in: Journal of Mathematical Analysis and Applications
publication date: 2005-06-23T00:00:00Z
Mathematics Subject Classification ID: 90C29
zbMATH DE Number: 2182079
zbMATH Keywords: Multiobjective linear programming
zbMATH Keywords: Efficient solutions set
zbMATH Keywords: Solution structure
MaRDI profile type: Publication
full work available at URL: j.jmaa.2004.08.069
OpenAlex ID: W1971872849
cites work: Determination of the efficient set in multiobjective linear programming
cites work: Finding all maximal efficient faces in multiobjective linear programming
cites work: Complete efficiency and the initialization of algorithms for multiple objective programming
cites work: Hybrid approach for solving multiple-objective linear programs in outcome space
cites work: Outcome space partition of the weight set in multiobjective linear programming
cites work: Relations between half-space and finitely generated cones in polyhedral cone-ratio DEA models
cites work: Q3844775
cites work: Analysis of the objective space in multiple objective linear programming
cites work: Constructing the set of efficient objective values in multiple objective linear programs
cites work: A combined constraint-space, objective-space approach for determining high-dimensional maximal efficient faces of multiple objective linear programs
cites work: Multiple Criteria Decision Making, Multiattribute Utility Theory: The Next Ten Years
cites work: Generating all maximal efficient faces for multiple objective linear programs
cites work: A representation of an efficiency equivalent polyhedron for the objective set of a multiple objective linear program
cites work: Proper efficiency and the theory of vector maximization
cites work: The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
cites work: Normal cones to a polyhedral convex set and generating efficient faces in linear multiobjective programming
cites work: Algorithms for the vector maximization problem
cites work: On the Minimization of Completion Time Variance with a Bicriteria Extension
cites work: An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming
cites work: Q3815146
cites work: A method of transferring cones of intersection form to cones of sum form and its applications in data envelopment analysis models
cites work: The set of all nondominated solutions in linear cases and a multicriteria simplex method
cites work: Linear multiobjective programming
DOI: 10.1016/J.JMAA.2004.08.069
description: scientific article; zbMATH DE number 2182079