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

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

扫码查看
原文链接
  • NETL
  • NSTL
  • 万方数据
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.

quadratic 0-1 programmingoptimality conditionnonconvex optimizationinteger programmingconvex duality

ZHANG Lian-sheng、CHEN Wei、YAO Yi-rong

展开 >

Department of Mathematics,College of Sciences,Shanghai University,Shanghai 200444,P.R.China

2010

10.1007/s11741-010-0214-2

上海大学学报(英文版)
上海大学

上海大学学报(英文版)

影响因子：0.196
ISSN：1007-6417
年,卷(期)：2010.14(2)
  • 1
  • 5