On the exactness of the -constraint method for biobjective nonlinear integer programming

DOI10.1016/J.ORL.2022.04.007MaRDI QIDQ2157908zbMATH OpenOpenAlexFDO

Authors Gabriele Eichfelder, Daniele Patria, M. De Santis

Publication date 22 July 2022

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.orl.2022.04.007

zbMATH Keywords

\(\varepsilon\)-constraint algorithmcriterion space algorithmsinteger programmingmultiobjective optimization

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Recommendations

• An exact -constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits
• An exact algebraic \(\epsilon \)-constraint method for bi-objective linear integer programming based on test sets
• Variants of the \(\varepsilon\)-constraint method for biobjective integer programming problems: application to \(p\)-median-cover problems
• A constraint method in nonlinear multi-objective optimization
• An exact algorithm for biobjective integer programming problems

Cites work

• A decision space algorithm for multiobjective convex quadratic integer optimization
• A Frank-Wolfe based branch-and-bound algorithm for mean-risk optimization
• A new method for mean-variance portfolio optimization with cardinality constraints
• An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
• An exact algorithm for biobjective integer programming problems
• An exact parallel objective space decomposition algorithm for solving multi-objective integer programming problems
• BARON: A general purpose global optimization software package
• Benchmarking optimization software with performance profiles.
• Branching with hyperplanes in the criterion space: the frontier partitioner algorithm for biobjective integer programming
• Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems
• Equal risk bounding is better than risk parity for portfolio selection
• Equity portfolio construction and selection using multiobjective mathematical programming
• Multi-objective branch and bound
• Multicriteria Optimization
• Scalarizations for adaptively solving multi-objective optimization problems
• Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations
• Solving multiobjective mixed integer convex optimization problems
• Twenty years of continuous multiobjective optimization in the twenty-first century

Cited in

(5)

• The -constrained method to solve a bi-objective problem of sustainable cultivation
• Exact Methods for Computing All Lorenz Optimal Solutions to Biobjective Problems
• scientific article; zbMATH DE number 3908171 (Why is no real title available?)
• A test instance generator for multiobjective mixed-integer optimization
• Designing sustainable diet plans by solving triobjective integer programs

This page was built for publication: On the exactness of the \(\varepsilon\)-constraint method for biobjective nonlinear integer programming

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