This paper describes a method to arrive at a feasible solution which can not be found in the linearly approximated constrained domain and a process which would reduce the number of finite element ...

In this paper a unified treatment of algorithms is described for linear programming methods based on the central path. This path is a curve along which the cost decreases, and that stays always far ...

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.