课题基金 / 基金详情

Enhancing the Solvability of Discrete and Continuous Nonconvex Programs with Applications to Production, Design, and Operational Problems

Enhancing the Solvability of Discrete and Continuous Nonconvex Programs with Applications to Production, Design, and Operational Problems
通过在生产、设计和操作问题中的应用来增强离散和连续非凸程序的可解性
批准号:
0552676
负责人:
Hanif Sherali
金额:
$32.06万
依托单位国家:
美国
项目类别:
Standard Grant
财政年份:
2006
资助国家:
美国
项目状态:
已结题
起止时间:
2006-09-01 至 2009-08-31

项目摘要

项目成果

Hanif Sherali的其他基金

相似基金

相关文献

中文摘要
翻译
这个项目涉及理论和算法的发展,以及与重构-线性化/凸化技术(RLT)相关的计算实现问题。在0-1和一般离散混合整数规划的背景下,将开发一种动态拉格朗日松弛策略来自动生成明智的RLT增强的重新公式。极小极大问题的专门化也将被研究。对一般整数或离散规划的扩展,包括开发一类新的Chvtal-Gomory层割,以及对凸约束问题的扩展,都将被研究。在连续非凸因式可分解规划问题中,将开发各种RLT约束生成和过滤策略来构造紧致可管理松弛,包括用于增强模型表示的一类新的半定割。将探索在国家空域规划和空中交通管理、生产调度、不确定情况下的工程设计和无线通信网络设计中的应用。这些应用的研究将包括对某些组合优化问题的多面体分析,例如广义顶点布局问题和非对称旅行商问题。这项研究的结果将提出概念,提供对问题结构和建模策略的见解,并提供产生紧致松弛的结构,从而为解决上述类型的问题提供有效的程序。这些贡献将推动最优化理论的发展,也将对上述应用领域产生影响。特别是,建议研究的空中交通管理应用程序将与联邦航空管理局(FAA)合作进行调查,并将通过减少延误和相关的航空成本以及提高国家空域的安全和运行效率而使社会受益。来自工程学院的学生将参与这项研究工作,该项目产生的技术将通过公共领域软件传播。
英文摘要
This project deals with theoretical and algorithmic developments, as well as computational implementation issues related to the Reformulation-Linearization/Convexification Technique (RLT). In the context of 0-1 and general discrete mixed-integer programs, a dynamic Lagrangian relaxation strategy will be developed to automatically generate judicious RLT-enhanced reformulations. Specializations for minimax problems will also be investigated. Extensions to general integer or discrete programs, including the development of a new class of Chvatal-Gomory Tier Cuts, as well as extensions to convex-constrained problems will be studied. In the arena of continuous nonconvex factorable programming problems, various RLT constraint generation and filtering strategies for constructing tight manageable relaxations will be developed, including a new class of semidefinite cuts for enhancing the model representation. Applications arising in national airspace planning and air-traffic management, production scheduling, engineering design under uncertainty, and wireless communication network design will be explored. The study of these applications will encompass polyhedral analyses of certain combinatorial optimization problems such as the generalized vertex packing problem and the asymmetric traveling salesman problem.The results of this study will advance concepts and offer insights into problem structures and modeling strategies, as well as provide a construct for generating tight relaxations leading to effective procedures for solving the above types of problems. The contributions will advance optimization theory as well as impact the aforementioned application domains. In particular, the air-traffic management application proposed for study will be investigated in cooperation with the Federal Aviation Administration (FAA), and will benefit society by reducing delays and related airline costs, as well as by enhancing the safety and operational efficiency of the national airspace. Students from across the College of Engineering will be involved in this research effort, and the technology generated by this project will be disseminated via public domain software.
期刊论文(0)
专著(0)
科研奖励(0)
会议论文
Collaborative Research: Reformulation-Linearization Technique for Discrete and Continuous Nonconvex Optimization with Applications
Integrated Operations Planning Models and Algorithms for the Airline Industry
International Conference on Complementarity, Duality, and Global Optimization; August 15-17, 2005; Virginia Tech - Blacksburg, VA
GOALI: Demand Driven Fleet Management Analysis, Models, and Algorithms for the Airline Industry
海外基金