Constructing efficient solutions structure of multiobjective linear programming

DOI10.1016/J.JMAA.2004.08.069zbMATH Open1066.90121OpenAlexW1971872849MaRDI QIDQ557002FDOQ557002

Quanling Wei, Jun Wang, Hong Yan

Publication date: 23 June 2005

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jmaa.2004.08.069

zbMATH Keywords

Efficient solutions setMultiobjective linear programmingSolution structure

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Proper efficiency and the theory of vector maximization
• Multiple Criteria Decision Making, Multiattribute Utility Theory: The Next Ten Years
• Algorithms for the vector maximization problem
• Hybrid approach for solving multiple-objective linear programs in outcome space
• Linear multiobjective programming
• The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
• Analysis of the objective space in multiple objective linear programming
• The set of all nondominated solutions in linear cases and a multicriteria simplex method
• An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming
• A method of transferring cones of intersection form to cones of sum form and its applications in data envelopment analysis models
• Generating all maximal efficient faces for multiple objective linear programs
• A combined constraint-space, objective-space approach for determining high-dimensional maximal efficient faces of multiple objective linear programs
• Finding all maximal efficient faces in multiobjective linear programming
• Determination of the efficient set in multiobjective linear programming
• Outcome space partition of the weight set in multiobjective linear programming
• Constructing the set of efficient objective values in multiple objective linear programs
• Normal cones to a polyhedral convex set and generating efficient faces in linear multiobjective programming
• On the Minimization of Completion Time Variance with a Bicriteria Extension
• A representation of an efficiency equivalent polyhedron for the objective set of a multiple objective linear program
• Complete efficiency and the initialization of algorithms for multiple objective programming
• Relations between half-space and finitely generated cones in polyhedral cone-ratio DEA models

Cited In (15)

• On FGP approach to multiobjective quadratic fractional programming problem
• The maximal descriptor index set for a face of a convex polyhedral set and some applications
• Finding efficient surfaces in DEA-R models
• A multiobjective based approach for mathematical programs with linear flexible constraints
• Adjacency based method for generating maximal efficient faces in multiobjective linear programming
• Characteristics and structures of weak efficient surfaces of production possibility sets
• Efficient curve fitting: an application of multiobjective programming
• The construction of a solution of the alternative linear programming problem
• An approach for finding efficient points in multiobjective linear programming
• On generating the set of nondominated solutions of a linear programming problem with parameterized fuzzy numbers
• A modified method for constructing efficient solutions structure of MOLP
• Determining maximal efficient faces in multiobjective linear programming problem
• Constructing the set of efficient objective values in linear multiple objective transportation problems
• Title not available (Why is that?)
• Constructing the set of efficient objective values in multiple objective linear programs

This page was built for publication: Constructing efficient solutions structure of multiobjective linear programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q557002)