On nadir points of multiobjective integer programming problems

DOI10.1007/S10898-017-0534-9MaRDI QIDQ1683328zbMATH OpenOpenAlexFDO

Authors Ö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 algorithmmultiobjective integer programming problemnadir point

Mathematics Subject Classification ID

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

Recommendations

• Finding nadir points in multi-objective integer programs
• Nadir Point Estimation Using Evolutionary Approaches: Better Accuracy and Computational Speed Through Focused Search
• Computing the nadir point for multiobjective discrete optimization problems
• Finding all nondominated points of multi-objective integer programs
• scientific article; zbMATH DE number 1784660

Cites work

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

Cited in

(6)

• A new method for optimizing a linear function over the efficient set of a multiobjective integer program
• -Constraint method for bi-objective competitive facility location problem with uncertain demand scenario
• Finding nadir points in multi-objective integer programs
• Computing the nadir point for multiobjective discrete optimization problems
• Finding all nondominated points of multi-objective integer programs
• A New Exact Algorithm to Optimize a Linear Function over the Set of Efficient Solutions for Biobjective Mixed Integer Linear Programs

Describes a project that uses

Uses Software

• VRP

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

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