Efficient solution generation for multiple objective linear programming based on extreme ray generation method

DOI10.1016/j.ejor.2003.08.039zbMath1067.90148OpenAlexW2062303304MaRDI QIDQ1887884

Masaaki Ida

Publication date: 22 November 2004

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2003.08.039

zbMATH Keywords

PolyhedraMultiple objective programmingEfficient solutionExtreme ray generation

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29)

Related Items (10)

Finding non dominated points for multiobjective integer convex programs with linear constraints ⋮ Multiple objective linear programming models with interval coefficients -- an illustrated overview ⋮ Efficient curve fitting: an application of multiobjective programming ⋮ Multiobjective interval linear programming in admissible-order vector space ⋮ On solutions of fuzzy random multiobjective quadratic programming with applications in portfolio problem ⋮ A new method for determining all maximal efficient faces in multiple objective linear programming ⋮ On fuzzy random multiobjective quadratic programming ⋮ New conditions for testing necessarily/possibly efficiency of non-degenerate basic solutions based on the tolerance approach ⋮ Determining maximal efficient faces in multiobjective linear programming problem ⋮ The maximal descriptor index set for a face of a convex polyhedral set and some applications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Possible and necessary efficiency in possibilistic multiobjective linear programming problems and possible efficiency test
• Analysis of the objective space in multiple objective linear programming
• A representation of an efficiency equivalent polyhedron for the objective set of a multiple objective linear program
• Multiobjective programming and planning
• Linear multiobjective programming
• A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
• Linear Multiple Objective Problems with Interval Coefficients
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
• Algorithm for finding a general formula for the non-negative solutions of a system of linear inequalities

This page was built for publication: Efficient solution generation for multiple objective linear programming based on extreme ray generation method