450-1: Mathematical Programming I

Description

Linear programming formulation, simplex algorithm, optimality conditions, duality, practical computation, extensions, applications, and case studies.

Prerequisites

linear algebra and calculus

Offerings

Instructor(s)

File(s)

Textbook(s)