Research Initiation: Interior Point Algorithms for Linear and Convex Programming

研究启动：线性和凸规划的内点算法

• 批准号: 8810107
• 负责人: Sanjay Mehrotra
• 金额: $ 6.64万
• 依托单位: Northwestern University
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 1988
• 资助国家: 美国
• 起止时间: 1988-09-15 至 1991-02-28
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=8810107&HistoricalAwards=false
• 关键词: Research; Initiation; Interior; Point; Algorithms

Since the development of Karmarkar's algorithm for linear programming, interest is rejuvenated in the interior point algorithms for solving linear and convex programming problems. Several variants of interior point algorithms have shown considerable promise to achieve substantial improvement in efficiency over the simplex method for linear programming problems. Through this proposal, we request funds to further continue our study of the theoretical properties and the computational effectiveness of these algorithms. We intend to effectively integrate the theory developed in our previous work with our experimental experience to develop a general purpose code for solving these problems.^R JUSTIFICATION

自从Karmarkar线性规划算法发展以来， 兴趣是振兴内点算法求解 线性和凸规划问题。 内部的几种变体 点算法已经显示出相当大的希望， 线性方程组的单纯形法效率的改进 编程问题。 通过这一提议，我们要求提供资金， 进一步研究了其理论性质和 这些算法的计算效率。 我们打算 有效地将我们以前工作中开发的理论与 我们的实验经验，开发一个通用的代码， 解决这些问题。R 理由