Formulation of engineering and planning problems as integer or nonlinear programs. Cutting planes and the branch and bound approach for IPs. Optimality conditions. Solution algorithms for unconstrained and constrained NLPs.

Pre-requisites: ISE303