Week 2

Question 1

What is an extreme point of a polyhedron?

Answer 1

A point that cannot be rewritten as the convex combination of two other points of the polyhedron

Question 2

How can a formula be rewritten to have an equality?

Answer 2

Create a non-negative slack (s) or surplus (t) variable

Question 3

When is an extreme point a basic feasible solution?

Answer 3

If is given a Polyhedron

Question 4

How to do the simplex method?

Answer 4

1. Create slack variables for the inequality constraints. And write down in a tableau. (See image).
2. Do the minimum ratio test, first for lowest variable in z (see second image)
3. Make sure variable is at one, while rest is at zero.