Research Initiation: Investigations in Nonlinear-Objective Combinatorial Optimization
Research Initiation: Investigations in Nonlinear-Objective Combinatorial Optimization
批准号:
9401424
负责人:
Jonathan Lee
金额:
$9.27万
依托单位国家:
美国
项目类别:
Standard Grant
财政年份:
1994
资助国家:
美国
项目状态:
已结题
起止时间:
1994-09-15 至 1998-08-31
中文摘要
[401424]李本研究涉及非线性目标组合优化问题的建模和求解技术的研究。三种基本的解决技术将被研究。这些技术是(1)线性化和多面体方法的结合,(2)特征值边界法与多面体和拉格朗日方法的结合,以及(3)通过几何方法进行模型评估。在测试模型及其解决方法时,确定了三类问题作为问题的来源。算法将被测试的应用领域是具有互连成本的网络设计问题、固定收费设施位置问题和实验设计问题。本研究的成果是:(1)对具有非线性目标函数的困难离散规划问题的整数规划公式的更一般的紧化方法的发展,(2)对具有非线性目标函数的规划问题的积分代数边界法的技术,(3)具有线性和非线性目标函数的离散规划问题的基于整数规划方法的分支切断程序设计的一般原则。研究的其他结果将是发展理解类似于网络设计和实验设计问题中的规划问题。
英文摘要
9401424 Lee The research is concerned with the modeling and investigation of solution techniques for nonlinear-objective combinatorial optimization problems. Three basic solution techniques are to be investigated. These techniques are (1) a combination of linearization and polyhedral methods, (2) combination of eigenvalue bounding methods with polyhedral and Lagrangian methods, and (3) model assessment through geometric methods. Three classes of problems are identified as sources of problems to be used in testing the models and their solution methods. The application areas for which the algorithms will be tested are network design problems with inter-link costs, fixed charge facility location problems, and experimental design problems. The outcome of this research are the development of (1) more general methods for tightening integer programming formulations of difficult discrete planning problems with nonlinear objective function, (2) techniques for integrating algebraic bounding methods for planning problems with nonlinear objective functions, and (3) general principles for the design of branch-and-cut procedures for integer programming based approaches for discrete planning problems with both linear and nonlinear objective function. Other outcomes of the research will be the development of understanding similar to those of planning problems in network design and experimental design problems.
期刊论文(0)
专著(0)
科研奖励(0)
会议论文
NSF Student Travel Grant for 2019 Integer Programming and Combinatorial Optimization (IPCO)
-
批准号:1856307
-
项目类别:Standard Grant
-
资助金额:$1.0万
-
财政年份:2019
-
负责人:Jonathan Lee
-
依托单位:
The reconsolidation of instrumental cocaine-seeking memories
-
批准号:MR/M017753/1
-
项目类别:Research Grant
-
资助金额:$61.7万
-
财政年份:2015
-
负责人:Jonathan Lee
-
依托单位:
Neural mechanisms of memory updating
-
批准号:BB/J014982/1
-
项目类别:Research Grant
-
资助金额:$51.24万
-
财政年份:2013
-
负责人:Jonathan Lee
-
依托单位:
Practical Algorithms for Applied Submodular Optimization
-
批准号:1160915
-
项目类别:Standard Grant
-
资助金额:$26.0万
-
财政年份:2012
-
负责人:Jonathan Lee
-
依托单位:
Acquisition of a High-Resolution Mass Spectrometer
-
批准号:0443618
-
项目类别:Standard Grant
-
资助金额:$18.42万
-
财政年份:2005
-
负责人:Jonathan Lee
-
依托单位:
NSF/CBMS Regional Conference in the Mathematical Sciences "Combinatorial Optimization:Packing and Covering" 5/18/99- 5/22/99
-
批准号:9812849
-
项目类别:Standard Grant
-
资助金额:$2.7万
-
财政年份:1998
-
负责人:Jonathan Lee
-
依托单位:
海外基金