Canonical dual approach to solving 0-1 quadratic programming problems

DOI10.3934/jimo.2008.4.155zbMath1180.90195MaRDI QIDQ999235

David Yang Gao, Shu-Cherng Fang, Soon-Yi Wu, Ruey-Lin Sheu

Publication date: 3 February 2009

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jimo.2008.4.155

zbMATH Keywords

global optimization; duality; NP-hard problems

Mathematics Subject Classification ID

90C26: Nonconvex programming, global optimization

90C20: Quadratic programming

49M37: Numerical methods based on nonlinear programming

90C09: Boolean programming

49N15: Duality theory (optimization)

Related Items

A canonical dual approach for solving linearly constrained quadratic programs, An improved lower bound and approximation algorithm for binary constrained quadratic programming problem, Complete solutions to general box-constrained global optimization problems, Canonical dual least square method for solving general nonlinear systems of quadratic equations, A review of recent advances in global optimization, Solutions to quadratic minimization problems with box and integer constraints, Global optimization for a class of fractional programming problems, Solutions and optimality criteria for nonconvex constrained global optimization problems with connections between canonical and Lagrangian duality, An exact penalty function method for nonlinear mixed discrete programming problems, A class of quasilinear elliptic hemivariational inequality problems, Lower semicontinuity of the solution mapping to a parametric generalized vector equilibrium problem