IOE510+Lecture+02+10+10+Wed

IOE510+Lecture+02+10+10+Wed - IOE 510 Linear Programming I...

Info iconThis preview shows pages 1–5. Sign up to view the full content.

View Full Document Right Arrow Icon
1 IOE 510 Linear Programming I Wednesday February 10, 2010 Professor Amy Cohn
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
2 Announcements Upcoming exam: Last name A – L go to FXB1024 Closed book One hand-written “cheat sheet” (standard size, both sides) If interpretation issues, ASK! Li’s drop-in office hours to be announced Amy’s drop-in office hours Friday 10:30 to 11:30 Friday 3:30 to 4:30
Background image of page 2
3 Announcements Topics What is an optimization problem What is a mathematical program What is a linear program Modeling techniques and examples Convex sets, functions, combinations; linear combinations Convexity of polyhedra Ways to represent points, lines, line segments Subspaces and affine subspaces LPs as affine subspaces Graphical method Vertices, extreme points, and basic feasible solutions Enumerating BFS’s Feasibility, optimality conditions for linear programs; unbounded
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
4 Announcements What to expect (roughly) 30% on modeling 30% on definitions, basic concepts Computation True/false 40% on theory, deeper understanding Proofs True/false
Background image of page 4
Image of page 5
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 26

IOE510+Lecture+02+10+10+Wed - IOE 510 Linear Programming I...

This preview shows document pages 1 - 5. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online