Efficient solution generation for multiple objective linear programming based on extreme ray generation method
type: Item
instance of: scholarly article
title: Efficient solution generation for multiple objective linear programming based on extreme ray generation method
zbMATH Open document ID: 1067.90148
author: Masaaki Ida
published in: European Journal of Operational Research
publication date: 2004-11-22T00:00:00Z
Mathematics Subject Classification ID: 90C29
zbMATH DE Number: 2117503
zbMATH Keywords: Multiple objective programming
zbMATH Keywords: Polyhedra
zbMATH Keywords: Efficient solution
zbMATH Keywords: Extreme ray generation
MaRDI profile type: Publication
full work available at URL: j.ejor.2003.08.039
OpenAlex ID: W2062303304
cites work: Linear multiobjective programming
cites work: The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
cites work: Multiobjective programming and planning
cites work: Q3815146
cites work: Linear Multiple Objective Problems with Interval Coefficients
cites work: Possible and necessary efficiency in possibilistic multiobjective linear programming problems and possible efficiency test
cites work: Analysis of the objective space in multiple objective linear programming
cites work: A representation of an efficiency equivalent polyhedron for the objective set of a multiple objective linear program
cites work: Q3818127
cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
cites work: Q5589748
cites work: Q5817857
cites work: Algorithm for finding a general formula for the non-negative solutions of a system of linear inequalities
cites work: A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
DOI: 10.1016/J.EJOR.2003.08.039
description: scientific article; zbMATH DE number 2117503