Global optimality conditions for quadratic 0-1 programming with inequality constraints

Lian Sheng Zhang*, Wei Chen, Yi Rong Yao

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)

Abstract

Quadratic 0-1 problems with linear inequality constraints are briefly considered in this paper. Global optimality conditions for these problems, including a necessary condition and some sufficient conditions, are presented. The necessary condition is expressed without dual variables. The relations between the global optimal solutions of nonconvex quadratic 0-1 problems and the associated relaxed convex problems are also studied.

Original languageEnglish
Pages (from-to)150-154
Number of pages5
JournalJournal of Shanghai University
Volume14
Issue number2
DOIs
Publication statusPublished - Apr 2010
Externally publishedYes

Keywords

  • Convex duality
  • Integer programming
  • Nonconvex optimization
  • Optimality condition
  • Quadratic 0-1 programming

Fingerprint

Dive into the research topics of 'Global optimality conditions for quadratic 0-1 programming with inequality constraints'. Together they form a unique fingerprint.

Cite this