Читать книгу Optimizations and Programming - Bouchaib Radi, Ghias Kharmanda, Michel Ledoux - Страница 25
1.6. Initialization of the simplex algorithm
ОглавлениеThis section presents two techniques for finding a basic realizable solution to initialize the simplex algorithm: the first is the Big M method, and the second is the Phase I method.