|Nov25-12, 05:27 PM||#1|
Linear programming: How to find extreme points and extreme directions?
I'm reading a book about linear programming and network flows. In chapter 2 when it talks about convex sets and their analysis it talks about extreme points and extreme directions of a convex set. I understand the definitions of extreme points and extreme directions, but I don't know how I should find them. Unfortunately the book doesn't show how to find them with examples. :( I also don't know what a 'slack variable' is. I guess it must've been defined somewhere but I missed it :/
Any helps would be appreciated.
|Nov26-12, 07:20 AM||#2|
C'mon.. it's really an easy question. No one here has ever passed a course in linear programming? really???
|Nov26-12, 09:39 AM||#3|
Generally you'll have one slack variable for each constraint inequality.
If you keep reading, you'll probably run into some examples.
|Similar Threads for: Linear programming: How to find extreme points and extreme directions?|
|Linear Algebra (Linear Programming) Feasible solutions and extreme points.||Calculus & Beyond Homework||1|
|differentiability and extreme points question||Calculus & Beyond Homework||16|
|CalcIII extreme values and saddle points||Calculus & Beyond Homework||2|
|Extreme points||Calculus & Beyond Homework||0|
|extreme points on parabola||Calculus & Beyond Homework||5|