Scholarlink

This first chapter recalls the main notions of linear programming, that is, the primal and dual formulations as well as necessary and sufficient optimality conditions. We also describe the primal simplex algorithm and discuss some aspects of integer linear programs.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Linear and Integer Linear Programming

  • 章节

  • 出版模式：

    开放获取

  • 发表日期：

    2026年

查看全文
  • Jacques Desrosiers,
  • Marco Lübbecke,
  • Guy Desaulniers,
  • Jean Bertrand Gauthier

摘要

This first chapter recalls the main notions of linear programming, that is, the primal and dual formulations as well as necessary and sufficient optimality conditions. We also describe the primal simplex algorithm and discuss some aspects of integer linear programs.