Article Contents
Article Contents

# Canonical dual approach to solving 0-1 quadratic programming problems

• By using the canonical dual transformation developed recently, we derive a pair of canonical dual problems for 0-1 quadratic programming problems in both minimization and maximization form. Regardless convexity, when the canonical duals are solvable, no duality gap exists between the primal and corresponding dual problems. Both global and local optimality conditions are given. An algorithm is presented for finding global minimizers, even when the primal objective function is not convex. Examples are included to illustrate this new approach.
Mathematics Subject Classification: 49N15, 49M37, 90C26, 90C20.

 Citation: