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.

The general linear model is a further special case with Z = 0 and . The following two examples illustrate the most common formulations of the general linear mixed model. Example: Growth Curve with ...