Linear programming is the study of optimizing a linear function over a set of linear inequalities. The Simplex Method, Ellipsoid Method and Interior Point Method are popular algorithms to solve linear programs.
Synonyms
linear-optimizationStats
| created | 15 years, 7 months ago |
| viewed | 24 times |
| editors | 0 |
Top Answerers
more »Recent Hot Answers
Maximum minimum difference between $f(k+1)$ and average of $f(0), \dots, f(2k+1)$Why is modular forms applicable to packing density bounds from linear programming at $n\in\{8,24\}$?
How did they come up with the MRRW bound?
Formula for volume of a convex polytope
Why is modular forms applicable to packing density bounds from linear programming at $n\in\{8,24\}$?
more »
Related Tags
linear-algebra × 115
convex-optimization × 100
integer-programming × 63
co.combinatorics × 53
convex-polytopes × 50
algorithms × 40
graph-theory × 35
global-optimization × 24
reference-request × 22
matrices × 19
convex-geometry × 19
discrete-geometry × 16
polyhedra × 14
pr.probability × 12
mg.metric-geometry × 11
inequalities × 11
duality × 11
real-analysis × 10
more related tags