Operations Research   (MAT 2461)   <-   Courses   <-   Sean Forman   <-   You Are Here

Please feel free to contact me if you have any questions about what is posted here. View the front page for further contact information.

Spring 2003
Syllabus in HTML format

This area contains information regarding the course.

Friday, April 11, 2003

Homework #10
posted 11:22 AM
Archive of Previous Days

Friday, March 21, 2003

Homework #8
posted 2:52 PM
Archive of Previous Days

Thursday, March 20, 2003

Homework #7
posted 9:37 AM
Archive of Previous Days

Tuesday, March 18, 2003

Homework #7
posted 1:46 PM
Homework #7
posted 1:45 PM
Homework #6
posted 12:46 PM
Archive of Previous Days

Tuesday, February 25, 2003

Homework #5
posted 1:27 PM
Archive of Previous Days

Tuesday, February 18, 2003

Homework #4

posted 1:45 PM
Archive of Previous Days

Wednesday, February 12, 2003

Topics this week

Tuesday - we finished up the basic simplex and then talked about handling minimization problems. I suggested using the negative of the maximization problems.

Wednesday - we will discuss multiple optimal solutions, unbounded LP's, degenerate LP's and finally the big M method.

Friday - after the quiz, I'll talk about Lindo and do a demonstration.
posted 10:31 AM

Archive of Previous Days

Tuesday, February 11, 2003

Tableau.pdf
posted 3:06 PM
Homework #3

It is two simplex problems, and it will be due on Friday. This should be a bit shorter than what we've had before.
posted 10:57 AM

Archive of Previous Days

Monday, February 10, 2003

Ask me about extra credit for career night
posted 7:11 AM
Archive of Previous Days

Wednesday, February 05, 2003

Main Topics

Today was a big day as we introduced the simplex method.

We talked about how to pick which variables enter the basic solution and which one leaves. We talked about the tableau.

We showed the relationship between extreme points, basic solutions, and adjacent solutions.
posted 7:19 PM

Archive of Previous Days

Friday, January 31, 2003

Main Topics Wednesday

The main topics last class were the special cases that arise when solving LP.

There are four possible outcomes to any LP problem.

How do we construct models for LP's?

Main Topics Today

We will have our quiz.

We will continue to look at models and how they can be built.

What is the standard form for an LP problem?
posted 11:29 AM

Homework #2
posted 11:27 AM
Archive of Previous Days

Tuesday, January 28, 2003

Main Topics

What is a linear programming problem?

What are the parts of an LP?

What is meant by the feasible region?

How can we solve them graphically?

What is the form of an LP?
posted 3:17 PM

Archive of Previous Days

Friday, January 24, 2003

Main Topics Today

Reduced-Row Echelon Form

Elementary Row Operations

What are the solutions from a matrix in RREF?

What are basic and non-basic variables?
posted 3:48 PM

Main Topics from Jan. 22, 2003

What is a matrix? Order? examples

What is a vector? dimension? examples

What are the matrix operations and how do they work?

posted 1:28 PM

Archive of Previous Days

Thursday, January 23, 2003

Homework #1
posted 12:28 PM
Archive of Previous Days


This page is powered by Blogger. Isn't yours?