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.

Formulate linear and integer programming problems for solving commonly encountered optimization problems. Understand how approximation algorithms compute solutions that are guaranteed to be within ...

This paper presents the results of experimentation on the development of an efficient branch-and-bound algorithm for the solution of zero-one linear mixed integer programming problems. An implicit ...

MG4C6.2 Mathematical Programming: Introduction to theory and the solution of linear and nonlinear programming problems: basic solutions and the simplex method, convex programming and KKT conditions, ...

M. Raghavachari, On Connections between Zero-One Integer Programming and Concave Programming under Linear Constraints, Operations Research, Vol. 17, No. 4 (Jul. - Aug ...