The book also addresses linear programming duality theory and its use in algorithm design as well as the Dual Simplex Method, Dantzig-Wolfe decomposition, and a primal-dual interior point algorithm.

Goal programming Numerical example. In order to reveal the ‘mechanics’ of achievement functions, we use a simplified diet model with two foods: (1) bread and (2) meat, with associated decision ...