Elements of a theory in non‐convex programming
作者:
Claude‐Alain Burdet,
期刊:
Naval Research Logistics Quarterly
(WILEY Available online 1977)
卷期:
Volume 24,
issue 1
页码: 47-66
ISSN:0028-1441
年代: 1977
DOI:10.1002/nav.3800240105
出版商: Wiley Subscription Services, Inc., A Wiley Company
数据来源: WILEY
摘要:
AbstractThe question of necessary and sufficient optimality conditions for non‐convex programs is analyzed in the general context of subadditivity. Several types of convex set extensions are investigated to generate valid inequalities from the corresponding gauge function
点击下载:
PDF
(834KB)
返 回