全球智库信息集成服务系统(G2TT): A Finitely Convergent Duality Theory for Zero-One Integer Programming.

G2TT

来源类型	Monograph (IIASA Research Memorandum)
规范类型	论文
	A Finitely Convergent Duality Theory for Zero-One Integer Programming.
	Bell DE; Shapiro JF
发表日期	1975
出版者	IIASA, Laxenburg, Austria: RM-75-033
出版年	1975
语种	英语
摘要	Given an integer programming problem, a constructive procedure is presented for generating a finite sequence of increasingly stronger dual problems to the given problem. The last dual problem in the sequence yields an optimal solution to the given integer programming problem. It is shown that this dual problem approximates the convex hull of the feasible integer solutions in a neighborhood of the optimal solution it finds. The theory is applicable to any bounded integer programming problem with rational data.
主题	System and Decision Sciences - Core (SDS)
URL	http://pure.iiasa.ac.at/id/eprint/483/
来源智库	International Institute for Applied Systems Analysis (Austria)
资源类型	智库出版物
条目标识符	http://119.78.100.153/handle/2XGU8XDN/120946
推荐引用方式 GB/T 7714	Bell DE,Shapiro JF. A Finitely Convergent Duality Theory for Zero-One Integer Programming.. 1975.