Many linear programming algorithms such as the simplex method optimize by examining only the extreme points and selecting the extreme point that gives the best solution value.

Question

Quizplus · Accepted Answer

This statement is true. The simplex method starts at an initial extreme point and then moves from extreme point to extreme point until the optimal solution is found. It does not examine any points other than the extreme points.

Many Linear Programming Algorithms Such as the Simplex Method Optimize