期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
Convex Analysis and Duality over Discrete Domains 被引量:2
1
作者 Murat Adıvar Shu-Cherng Fang 《Journal of the Operations Research Society of China》 EI CSCD 2018年第2期189-247,共59页
The aim of this paper is to establish a fundamental theory of convex analysis for the sets and functions over a discrete domain.By introducing conjugate/biconjugate functions and a discrete duality notion for the cone... The aim of this paper is to establish a fundamental theory of convex analysis for the sets and functions over a discrete domain.By introducing conjugate/biconjugate functions and a discrete duality notion for the cones over discrete domains,we study duals of optimization problems whose decision parameters are integers.In particular,we construct duality theory for integer linear programming,provide a discrete version of Slater’s condition that implies the strong duality and discuss the relationship between integrality and discrete convexity. 展开更多
关键词 Discrete convex analysis Discrete Lagrangian duality Discrete slater’s condition Discrete strong duality Integer programming INTEGRALITY
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部