Title: Disjunctive Methods for Linear and Nonlinear Integer Programs

This talk is on theoretical properties and computational methods for solving mixed-binary and mixed-integer linear and convex programs. You will learn about a disjunctive branch-and-cut method for mixed-binary convex programs; the use of binary variables in reformulations of mixed-integer programs; a disjunctive cutting plane procedure for mixed-integer linear programs; and a generalized branch-and-bound method for mixed integer linear programs. We will support our presentation with computational results.