# Lecture06 - IE 505 MATHEMATICAL PROGRAMMING Bahar Yetis...

This preview shows pages 1–8. Sign up to view the full content.

IE 505 MATHEMATICAL PROGRAMMING Bahar Yetis Kara Lecture # 6 Date: 7 October 2007 1

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

View Full Document
2 Some Conventions
Geometric Solutions Revisited Recall the LP models with 2 variables The optimum solution was an extreme point. How do we find the coordinates of an extreme point? 3

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

View Full Document
EXTREME POINTS A point x in a convex set S , is called an extreme point of S if x cannot be represented as a strict convex combination of two distinct points of S . In other words if and 1) 0 ( with ) 1 ( 2 1 x x x S , 2 1 x x 2 1 x then x x 4
Extreme Points Ex: Given a convex set S x 1 x 3 x 2 5

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

View Full Document
Binding Constraints Consider If a vector x satisfies we say that the corresponding constraint is active or binding at x. } : { b Ax R x P n i T i b x a 6
Let be a polyhedron. Let x Є R n . The vector x is a basic solution with respect to P if there exists n linearly independent and binding constraints at x. If x is a

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 04/15/2010 for the course INDUSTRIAL ie513 taught by Professor Zeynephuygur during the Spring '10 term at Bilkent University.

### Page1 / 25

Lecture06 - IE 505 MATHEMATICAL PROGRAMMING Bahar Yetis...

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

View Full Document
Ask a homework question - tutors are online