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/S0217595916500317zbMATH Open1348.90362OpenAlexW2503184760MaRDI QIDQ2821098FDOQ2821098
Authors: 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
Recommendations
- A method for generating a well-distributed Pareto set in nonlinear multiobjective optimization
- A new Pareto set generating method for multi-criteria optimization problems
- Algorithms for generating Pareto fronts of multi-objective integer and mixed-integer programming problems
- Computing the Pareto frontier of a bi-objective bi-level linear problem using a multiobjective mixed-integer programming algorithm
- scientific article; zbMATH DE number 1149789
- scientific article; zbMATH DE number 4010232
- A method for selecting Pareto optimal solutions in multiobjective optimization
- A multi-objective selection procedure of determining a Pareto set
- A new mixed integer programming approach for optimization over the efficient set of a multiobjective linear programming problem
- Approximating the Pareto set of multiobjective linear programs via robust optimization
Management decision making, including multiple objectives (90B50) Multi-objective and goal programming (90C29) Mixed integer programming (90C11)
Cites Work
- Multiple objective decision making - methods and applications. A state- of-the-art survey. In collaboration with Sudhakar R. Paidy and Kwangsun Yoon
- An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems
- A method for finding the set of non-dominated vectors for multiple objective integer linear programs
- Multi‐objective combinatorial optimization problems: A survey
- A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs
- Title not available (Why is that?)
- A review of interactive methods for multiobjective integer and mixed-integer programming
- A branch and bound algorithm for mixed zero-one multiple objective linear programming
- The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
- On finding representative non-dominated points for bi-objective integer network flow problems
- Representation of the non-dominated set in biobjective discrete optimization
- A Procedure to Find Discrete Representations of the Efficient Set with Specified Coverage Errors
- Title not available (Why is that?)
- A general method for determining the set of all efficient solutions to a linear vectormaximum problem
- 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
Cited In (2)
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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2821098)
