Linear and Integer Linear Programming

Springer eBooks, pp. 1–42

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.

Authors 4

1. Jacques Desrosiers corresponding

   HEC Montréal · Group for Research in Decision Analysis

   Affiliation as printed

   GERAD and Département de sciences de la décision, HEC Montréal, Montréal, Canada

2. Marco E. Lübbecke Aachen GERAD and School of Business and Economics

   RWTH Aachen University

   Affiliation as printed

   GERAD and School of business and economics, RWTH Aachen University, Aachen, Germany

3. Guy Desaulniers

   Polytechnique Montréal · Group for Research in Decision Analysis

   Affiliation as printed

   GERAD and Département de mathématiques et de génie industriel, Polytechnique Montréal, Montréal, Canada

4. Jean Bertrand Gauthier
   Affiliation as printed

   Mainz, Germany