Stop! Stop right now! This is a set of lecture notes. It is not a book. Go away and come back when you have a real textbook on Linear Programming. Okay, do you have a book? Alright, let's move on then. This is a set of lecture notes for Math 484{Penn State's undergraduate Linear Programming course. Since I use these notes while I teach, there may be typographical errors that I noticed in class, but did not fix in the notes. If you see a typo, send me an e-mail and I'll add an acknowledgement. There may be many typos, that's why you should have a real textbook.

The lecture notes are based on the first 6 chapters of Bazaraa et al.'s Linear Programming and Network Flows book. This is a reasonably good book, written primarily by and for Industrial Engineers. The only problem I have with the book is that it does not present major results in the standard theorem-proof style common to mathematical discourse. This set of notes corrects this problem by presenting the material in a format for presentation to a mathematics class. Many of the proofs in this set of notes are adapted from the textbook with some minor additions. (For example, each time Bazaraa et al. ask, "Why?" in a proof, I provide this information.) Additionally, I prefer to present maximization problems, while Linear Programming and Network Flows prefers the minimization format. I've modified all the proofs to operate on maximization problems. When used with the book, the student can obtain a complete set of proofs for elementary Linear Programming.