Finding nadir points in multi-objective integer programs

DOI10.1007/s10898-014-0212-0zbMath1342.90177OpenAlexW2029555266MaRDI QIDQ2350074

Banu Lokman, Murat M. Köksalan

Publication date: 18 June 2015

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

Full work available at URL: https://doi.org/10.1007/s10898-014-0212-0

zbMATH Keywords

integer programmingmulti-objectivenadir point

Mathematics Subject Classification ID

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

Related Items (9)

Distribution based representative sets for multi-objective integer programs ⋮ On nadir points of multiobjective integer programming problems ⋮ Optimizing a linear function over the nondominated set of multiobjective integer programs ⋮ A Feasibility Pump and Local Search Based Heuristic for Bi-Objective Pure Integer Linear Programming ⋮ A New Exact Algorithm to Optimize a Linear Function over the Set of Efficient Solutions for Biobjective Mixed Integer Linear Programs ⋮ Representing the nondominated set in multi-objective mixed-integer programs ⋮ Multi-objective branch and bound ⋮ A new method for optimizing a linear function over the efficient set of a multiobjective integer program ⋮ FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming

Cites Work

• An interactive algorithm to find the most preferred solution of multi-objective integer programs
• Finding all nondominated points of multi-objective 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.
• An algorithm for optimizing a linear function over an integer efficient set
• A Heuristic for Estimating Nadir Criterion Values in Multiple Objective Linear Programming

This page was built for publication: Finding nadir points in multi-objective integer programs