Compară metode
Examinează metodele selectate una lângă alta; rândurile care diferă sunt evidențiate.
| Programare Liniară× | Programare neliniară× | |
|---|---|---|
| Domeniu | Optimizare | Optimizare |
| Familie | Process / pipeline | Process / pipeline |
| Anul apariției≠ | 1947 | 2006 |
| Autorul original≠ | George B. Dantzig | Jorge Nocedal & Stephen Wright |
| Tip≠ | Mathematical programming / continuous optimization | Continuous mathematical optimization |
| Sursa seminală≠ | Dantzig, G.B. (1963). Linear Programming and Extensions. Princeton University Press. ISBN: 9780691059136 | Nocedal, J., & Wright, S. J. (2006). Numerical Optimization (2nd ed.). Springer. ISBN: 978-0-387-30303-1 |
| Denumiri alternative≠ | LP, linear optimization, Doğrusal Programlama (LP) | NLP optimization, Constrained nonlinear optimization, Smooth optimization, Doğrusal olmayan programlama |
| Înrudite≠ | 4 | 3 |
| Rezumat≠ | 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. | Nonlinear programming (NLP) is a branch of mathematical optimization concerned with problems in which the objective function or at least one constraint is nonlinear. Formalized comprehensively by Jorge Nocedal and Stephen Wright in their seminal 2006 text, NLP encompasses gradient-based algorithms — including sequential quadratic programming (SQP), interior-point methods, and quasi-Newton approaches — for finding locally or globally optimal solutions to continuous decision problems arising across engineering, economics, and the physical sciences. |
| ScholarGateSet de date ↗ |
|
|