\`x^2+y_1+z_12^34\`
Advanced Search
Advanced Search
Advanced Search
This issue Previous Article Next Article
Article Contents
Article Contents
2008, Volume 4, Issue 1: 125-142. Doi: 10.3934/jimo.2008.4.125
This issue Previous Article A unified model for state feedback of discrete event systems I: framework and maximal permissive state feedback Next Article Semismooth reformulation and Newton's method for the security region problem of power systems

Canonical dual approach to solving 0-1 quadratic programming problems

  • 1.

    Department of Industrial and Systems Engineering, North Carolina State University, Raleigh, NC

  • 2.

    Department of Mathematics, Virginia Tech, Blacksburgh, VA

  • 3.

    Department of Mathematics, National Cheng Kung University, Taiwan, ROC

  • 4.

    Department of Mathematics, National Cheng Kung University, Tainan

Received:  January 31, 2007
Revised:  October 31, 2007
Published:  December 2007
Abstract Related Papers Cited by
    Abstract
  • 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:
    shu

    \begin{equation} \\ \end{equation}
    • Related Papers
  • Cited by
  • Access History
  • 加载中
PDF
XML
Export Citation
SHARE
Email to a Friend

Article Metrics

HTML views() PDF downloads(159) Cited by(0)

Access History

Other Articles By Authors

Catalog

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return
    Site map Copyright © 2023 American Institute of Mathematical Sciences