Optimizing a linear function over the nondominated set of multiobjective integer programs

DOI10.1111/itor.12627OpenAlexW2911449251WikidataQ128549610 ScholiaQ128549610MaRDI QIDQ6091884

Banu Lokman

Publication date: 21 November 2023

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://researchportal.port.ac.uk/portal/en/publications/optimizing-a-linear-function-over-the-nondominated-set-of-multiobjective-integer-programs(d2680f79-b2da-4ae3-bf55-4f0bd3ea354a).html

zbMATH Keywords

integer programmingcombinatorial optimizationmultiple objective programmingnondominated set

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (5)

An exact method for optimizing a quadratic function over the efficient set of multiobjective integer linear fractional program ⋮ Optimization of a linear function over an integer efficient set ⋮ Coordinated optimized scheduling of locks and transshipment in inland waterway transportation using binary NSGA‐II ⋮ Optimization of a quadratic programming problem over an Integer efficient set ⋮ Parallel optimization over the integer efficient set

Cites Work

• Unnamed Item
• The \(L\)-shape search method for triobjective integer programming
• Finding all nondominated points of multi-objective integer programs
• A bilinear algorithm for optimizing a linear function over the efficient set of a multiple objective linear programming problem
• Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors.
• Multi-objective integer programming: a general approach for generating all non-dominated solutions
• The maximization of a function over the efficient set via a penalty function approach
• Optimization over the efficient set: Four special cases
• Optimizing a linear function over an efficient set
• A new method for optimizing a linear function over the efficient set of a multiobjective integer program
• A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
• A simple augmented \(\epsilon\)-constraint method for multi-objective mathematical integer programming problems
• A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems
• Finding nadir points in multi-objective integer programs
• Computing the nadir point for multiobjective discrete optimization problems
• An algorithm for optimizing a linear function over an integer efficient set
• Optimizing a linear function over an integer efficient set
• Optimization over the efficient set

This page was built for publication: Optimizing a linear function over the nondominated set of multiobjective integer programs