课题基金 / 基金详情

Nonconvex Combinatorial Optimization without Auxiliary Binary Variables

Nonconvex Combinatorial Optimization without Auxiliary Binary Variables
没有辅助二元变量的非凸组合优化
批准号:
0100020
负责人:
George Nemhauser
金额:
$40.57万
依托单位国家:
美国
项目类别:
Continuing Grant
财政年份:
2001
资助国家:
美国
项目状态:
已结题
起止时间:
2001-06-01 至 2005-12-31

项目摘要

项目成果

George Nemhauser的其他基金

相似基金

相关文献

中文摘要
翻译
点击翻译按钮获取中文摘要
英文摘要
This project is about solving Nonconvex Combinatorial Optimization Problems (NCOPs) by linear programming based branch-and-bound algorithms. Most NCOPs can be reformulated as mixed-integer programs (MIPs) by the addition of auxiliary binary variables. For this reason the study of NCOPs other than MIPs has been very limited. However, reformulation may have many disadvantages including increasing the size of the problem significantly. There are some NCOP structures that arise naturally in many practical applications and therefore merit study in their own right. These include: (1) semi-continuous - if a nonnegative variable is positive, it must be at least some positive constant; (2) k-cardinality - no more than k variables from a set of n nonnegative variables may be positive; (3) special ordered set of type 2 - no more than 2 variables from a sequence of n nonnegative variables may be positive, and if 2 variables are positive, they must be adjacent in the sequence. The primary objective of this project is to study these and a small number of other NCOP structures, as has been done for MIPS, and to develop preprocessing procedures, polyhedral results (cuts), branching procedures, and primal heuristics for dealing with them directly. The end result will be efficient branch-and-cut algorithms for linear programs with piecewise linear nonconvex objectives, nonconvex quadratic programs, scheduling and facility location problems, and several other NP-hard problems for which an MIP approach has not been very successful. Decision making problems in manufacturing and logistics, such as resource allocation and facility location are represented by optimization models. This project contributes to the knowledge of algorithms for solving such optimization models that contain certain types of nonlinearities that make the models very difficult to solve. The results of this project will provide significant enhancements to the optimization tools that are used in practice.
期刊论文(0)
专著(0)
科研奖励(0)
会议论文
Eager: Discrete Optimization Algorithms for 21st Century Algorithms
  • 批准号:
    1415460
  • 项目类别:
    Standard Grant
  • 资助金额:
    $30.0万
  • 财政年份:
    2014
  • 负责人:
    George Nemhauser
  • 依托单位:
Exploratory Research on Engineering the Transport Industries (ETI): Robust Planning for Routing
  • 批准号:
    0085723
  • 项目类别:
    Standard Grant
  • 资助金额:
    $16.0万
  • 财政年份:
    2000
  • 负责人:
    George Nemhauser
  • 依托单位:
17th International Symposium on Mathematical Programming (ISMP 2000)
  • 批准号:
    0073030
  • 项目类别:
    Standard Grant
  • 资助金额:
    $3.8万
  • 财政年份:
    2000
  • 负责人:
    George Nemhauser
  • 依托单位:
Research in Large-Scale Integer Programming
  • 批准号:
    9700285
  • 项目类别:
    Continuing Grant
  • 资助金额:
    $50.1万
  • 财政年份:
    1997
  • 负责人:
    George Nemhauser
  • 依托单位:
海外基金