Résumé de section

  • In Chapter 2, we studied the simplex method, which allows us to determine the optimal solution to a linear programme, moving from one feasible basic solution to another that improves the value of the objective function, starting with an initial solution. 

    However, the initial solution is not always obvious; sometimes an entire initialisation phase must be carried out.

    For the initialisation of the simplex algorithm, i.e. finding a starting solution, two methods will be studied in this chapter.

                   - The two-phase method.

                   - The Big-M method.