Сравнение на методи
Прегледайте избраните методи един до друг; редовете с разлики са откроени.
| Квадратично програмиране (QP)× | Линейно оптимиране× | |
|---|---|---|
| Област | Оптимизация | Оптимизация |
| Семейство | Process / pipeline | Process / pipeline |
| Година на възникване≠ | 1956 | 1947 |
| Създател≠ | Marguerite Frank & Philip Wolfe | George B. Dantzig |
| Тип≠ | Constrained mathematical optimization | Mathematical programming / continuous optimization |
| Основополагащ източник≠ | Frank, M., & Wolfe, P. (1956). An algorithm for quadratic programming. Naval Research Logistics Quarterly, 3(1–2), 95–110. DOI ↗ | Dantzig, G.B. (1963). Linear Programming and Extensions. Princeton University Press. ISBN: 9780691059136 |
| Други названия≠ | QP Optimization, Quadratic Optimization, Convex Quadratic Programming, İkinci Dereceden Programlama | LP, linear optimization, Doğrusal Programlama (LP) |
| Свързани≠ | 2 | 4 |
| Резюме≠ | Quadratic Programming (QP) is a class of constrained mathematical optimization in which the objective function is quadratic and the constraints are linear. Formalized by Frank and Wolfe (1956) through their gradient-based feasible-direction algorithm, QP is foundational in operations research, finance, machine learning, and engineering design wherever one must minimize a convex (or non-convex) quadratic cost subject to linear feasibility conditions. | Linear programming (LP), pioneered by George B. Dantzig in 1947, is a mathematical method for finding the best value of a linear objective function — such as minimum cost or maximum profit — subject to a set of linear inequality and equality constraints. It is the foundational technique in operations research and underlies production planning, resource allocation, logistics, diet problems, and countless other decision-making scenarios across engineering, economics, and the natural sciences. |
| ScholarGateНабор от данни ↗ |
|
|