Cutting Planes for Mixed-Integer Programs

混合整数程序的割平面

• 批准号: 9101578
• 负责人: E. Andrew Boyd
• 金额: --
• 依托单位: William Marsh Rice University
• 依托单位国家: 美国
• 项目类别: Continuing grant
• 财政年份: 1991
• 资助国家: 美国
• 起止时间: 1991-07-15 至 1992-08-25
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=9101578&HistoricalAwards=false
• 关键词: Cutting; Planes; Mixed; Integer; Programs

Integer and mixed-integer programs arise in a wealth of applications ranging from logistics to very large scaled integration design. Recent cutting plane techniques have proven remarkably successful in the solution of integer programs. Unfortunately, cutting plane techniques have not been applied with the same frequency or success to mixed-integer programs. The goal of this research is to develop the theory surrounding this technique as it relates to mixed-integer programming and to implement algorithms that generate cutting planes for mixed-integer programs. Ultimately, the goal is to solve large mixed-integer programs using these algorithms. Applications of mixed-integer programming are so extensive that advances in techniques for their solution will have far reaching consequences extending across many disciplines. Additional objectives include establishing a public domain library of mixed-integer programs and providing developed algorithms to researchers.

整数和混合整数程序出现在丰富的 应用范围从物流到超大规模 一体化设计 最近的切割平面技术已经证明 在解决整数规划方面取得了显著的成功。 不幸的是，切割平面技术尚未应用于 相同的频率或成功的混合整数程序。 目标 这项研究的一个重要目的是发展围绕这一点的理论， 技术，因为它涉及混合整数规划和 实现为混合整数生成切割平面的算法 程序. 最终目标是求解大混合整数 使用这些算法的程序。 混合整数的应用 编程是如此广泛，在技术上的进步， 解决方案将产生深远的影响， 学科 其他目标包括建立公共 域库的混合整数规划和提供开发 研究人员的算法。