Exam Format:
10 Questions, not multiple choice.
Time alloted: 180 minutes
--------

For the exam you are responsible for the following topics.
(Chapter references are to the BT text)

1. Chapter 1: Introduction (1.1 to 1.5) & Extra Topic: Block Multiplication

1.1: Variants of the linear programming problem
1.2: Examples of the linear programming problem
1.3: Piecewise linear convex objective function
1.4: Graphical representation and solution
1.5: Linear algebra background and notation

->&  Extra Topic: Block Multiplication


2. Chapter 2: The Geometry of Linear Programming (2.1 to 2.6)

2.1: Polyhedra and convex sets
2.2: Extreme points, vertices, and basic feasible solutions
2.3: Polyhedra in standard form
2.4: Degeneracy
2.5: Existence of extreme points
2.6: Optimality of extreme points


3. Chapter 3: The Simplex Method (3.1 to 3.5)

3.1: Optimality conditions
3.2: Development of the simplex method.
3.3: Implementations of the simplex method.

3.4: Anticycling: lexicography and Bland's rule.
3.5: Finding an initial basic feasible solution.** 
(**Up to pg 112 before and not including the section"Driving Artificial Variables". The rest of the section is NOT on the exam)


4. Chapter 4: Duality Theory (4.1,4.2)

4.1: Motivation
4.2: The dual problem