A Method for Generating a Well-Distributed Pareto Set in Multiple Objective Mixed Integer Linear Programs Based on the Decision Maker’s Initial Aspiration Level

DOI10.1142/S0217595916500317zbMath1348.90362OpenAlexW2503184760MaRDI QIDQ2821098

S. Razavyan

Publication date: 16 September 2016

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0217595916500317

zbMATH Keywords

integer programmingmultiple objective programmingPareto optimaldiscrete representationideal-point

Mathematics Subject Classification ID

Mixed integer programming (90C11) Multi-objective and goal programming (90C29) Management decision making, including multiple objectives (90B50)

Cites Work

• On finding representative non-dominated points for bi-objective integer network flow problems
• Representation of the non-dominated set in biobjective discrete optimization
• A review of interactive methods for multiobjective integer and mixed-integer programming
• A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs
• A general method for determining the set of all efficient solutions to a linear vectormaximum problem
• Multiple objective decision making - methods and applications. A state- of-the-art survey. In collaboration with Sudhakar R. Paidy and Kwangsun Yoon
• A branch and bound algorithm for mixed zero-one multiple objective linear programming
• A method for finding the set of non-dominated vectors for multiple objective integer linear programs
• An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems
• A Procedure to Find Discrete Representations of the Efficient Set with Specified Coverage Errors
• The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
• Towards finding global representations of the efficient set in multiple objective mathematical programming
• A METHOD FOR GENERATING ALL THE EFFICIENT SOLUTIONS OF A 0-1 MULTI-OBJECTIVE LINEAR PROGRAMMING PROBLEM
• Multi‐objective combinatorial optimization problems: A survey
• Unnamed Item
• Unnamed Item

This page was built for publication: A Method for Generating a Well-Distributed Pareto Set in Multiple Objective Mixed Integer Linear Programs Based on the Decision Maker’s Initial Aspiration Level