Timeline for Why is solving a MILP w/o an objective function so much faster?
Current License: CC BY-SA 2.5
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 9, 2010 at 6:26 | comment | added | Matus Telgarsky | I should add that the feasibility set can also be the empty set, or it can be unbounded (but still an intersection of halfplanes) | |
| Feb 9, 2010 at 6:25 | comment | added | Matus Telgarsky | A couple things wrong here. first, the feasible set is a convex polytope, not necessarily a simplex. the simplex algorithm indeed walks the vertices, however there are many algorithms which behave otherwise (for instance en.wikipedia.org/wiki/Interior_point_method) | |
| Feb 9, 2010 at 3:29 | history | answered | Jimmy | CC BY-SA 2.5 |