Timeline for Existence of extreme points in primal and dual LP
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 9, 2022 at 21:17 | comment | added | prubin♦ | Full row rank might require that you first insert slacks and surpluses. For instance, you might want to say $a'x \le b_1$ and $a'x \ge b_2$ (same $a$ both places). That creates an initial $A$ matrix (before slacks) with row rank less than the number of rows. You get full rank after expanding the matrix. | |
| Dec 9, 2022 at 19:06 | comment | added | prubin♦ | Seems plausible, but plausible $\neq$ proven. :-) | |
| Dec 9, 2022 at 18:39 | comment | added | Krypt | This is interesting! So maybe we can safely say that dual also has extreme points if primal has finite optimum and the primal constraint matrix has linearly independent rows? | |
| Dec 9, 2022 at 18:34 | history | answered | prubin♦ | CC BY-SA 4.0 |