On nadir points of multiobjective integer programming problems

DOI10.1007/s10898-017-0534-9zbMath1381.90082OpenAlexW2617450314MaRDI QIDQ1683328

Özgür Özpeynirci

Publication date: 7 December 2017

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-017-0534-9

zbMATH Keywords

exact algorithmnadir pointmultiobjective integer programming problem

Mathematics Subject Classification ID

Integer programming (90C10) Multi-objective and goal programming (90C29)

Related Items (2)

A New Exact Algorithm to Optimize a Linear Function over the Set of Efficient Solutions for Biobjective Mixed Integer Linear Programs ⋮ \(\varepsilon\)-Constraint method for bi-objective competitive facility location problem with uncertain demand scenario

Uses Software

• VRP

Cites Work

• Finding all nondominated points of multi-objective integer programs
• NAUTILUS method: an interactive technique in multiobjective optimization based on the Nadir point
• An exact method for computing the nadir values in multiple objective linear programming
• Multi-objective integer programming: a general approach for generating all non-dominated solutions
• The interactive analysis of the multicriteria shortest path problem by the reference point method.
• Computation of ideal and Nadir values and implications for their use in MCDM methods.
• Outcome space partition of the weight set in multiobjective linear programming
• A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
• Finding nadir points in multi-objective integer programs
• Computing the nadir point for multiobjective discrete optimization problems
• A Recursive Algorithm for Finding All Nondominated Extreme Points in the Outcome Set of a Multiobjective Integer Programme
• An Exact Algorithm for Finding Extreme Supported Nondominated Points of Multiobjective Mixed Integer Programs
• Nadir Point Estimation Using Evolutionary Approaches: Better Accuracy and Computational Speed Through Focused Search
• A naïve approach for solving MCDM problems: the GUESS method
• A Heuristic for Estimating Nadir Criterion Values in Multiple Objective Linear Programming
• Linear programming with multiple objective functions: Step method (stem)

This page was built for publication: On nadir points of multiobjective integer programming problems