Integer programming duality in multiple objective programming
From MaRDI portal
Publication:1888158
DOI10.1023/B:JOGO.0000035000.06101.07zbMath1073.90041OpenAlexW2009869936MaRDI QIDQ1888158
Sibylle Zust, Kathrin Klamroth, Jørgen Tind
Publication date: 22 November 2004
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/b:jogo.0000035000.06101.07
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)
Related Items (6)
A discussion of scalarization techniques for multiple objective integer programming ⋮ Optimising a nonlinear utility function in multi-objective integer programming ⋮ Interactive polyhedral outer approximation (IPOA) strategy for general multiobjective optimization problems ⋮ Connections among constrained continuous and combinatorial vector optimization ⋮ A survey of recent developments in multiobjective optimization ⋮ Multi-objective integer programming: a general approach for generating all non-dominated solutions
Uses Software
This page was built for publication: Integer programming duality in multiple objective programming
