Mathematical Sciences: Algorithms for Mathematical Programming

数学科学：数学规划算法

• 批准号: 9106195
• 负责人: Donald Goldfarb
• 金额: $ 12万
• 依托单位: Columbia University
• 依托单位国家: 美国
• 项目类别: Continuing Grant
• 财政年份: 1991
• 资助国家: 美国
• 起止时间: 1991-09-01 至 1995-08-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=9106195&HistoricalAwards=false
• 关键词: Mathematical; Sciences; Algorithms; Programming

This project will develop, analyze, and implement algorithms for solving mathematical programming problems. It is planned to focus on simplex algorithms, interior point algorithms, and methods that combine them. The research on simplex algorithms will be directed towards solving network flow problems including maximum flow, minimum flow, generalized network flow problems, and multicommodity flow problems. The research on interior point algorithms will concentrate on solving structured linear programs, exploring large step path-following algorithms, solving nonlinear programming problems. This research will involve theoretical analysis of the algorithms and their implementation and empirical testing. Extensive areas of society where operations research is required will benefit from this project.

这个项目将开发、分析和实现算法 来解决数学规划问题。 计划在 专注于单纯形算法，内点算法， 将它们联合收割机结合起来的方法。 单纯形算法的研究 将针对解决网络流问题，包括 最大流，最小流，广义网络流问题， 和多商品流动问题。关于内点的研究 算法将专注于解决结构化线性 程序，探索大步长路径跟踪算法，求解 非线性规划问题 这项研究将涉及理论分析， 算法及其实现和实证测试。 广泛的社会领域需要运筹学 将从这个项目中受益。