Linear and Integer Linear Programming

Read full text
Authors: Jacques Desrosiers, Marco E. Lübbecke, Guy Desaulniers, Jean Bertrand Gauthier
Cited by: 0

Abstract

Abstract 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.

Fields of Study & Subjects

Advanced Optimization Algorithms Research Complexity and Algorithms in Graphs Optimization and Mathematical Programming

Publication details

Journal / source
Springer eBooks
Pages
1–42
Publication date
1 January 2026
Language
EN
Document type
Book chapter