Confronta i metodi

	Programmazione Intera	Programmazione non lineare	Ottimizzazione Robusta
Campo	Ottimizzazione	Ottimizzazione	Ottimizzazione
Famiglia	Process / pipeline	Process / pipeline	Process / pipeline
Anno di origine	1958	2006	1970s theoretical roots; modern tractable form from late 1990s–2004
Ideatore	Ralph Gomory (cutting planes, 1958); land-and-doig branch-and-bound (1960)	Jorge Nocedal & Stephen Wright	Ben-Tal, El Ghaoui & Nemirovski (seminal book, 2009); Bertsimas & Sim (tractable polyhedral formulation, 2004)
Tipo	Mathematical optimisation — exact combinatorial method	Continuous mathematical optimization	Mathematical programming framework
Fonte seminale	Wolsey, L.A. (1998). Integer Programming. Wiley. ISBN: 9780471283669	Nocedal, J., & Wright, S. J. (2006). Numerical Optimization (2nd ed.). Springer. ISBN: 978-0-387-30303-1	Ben-Tal, A., El Ghaoui, L. & Nemirovski, A. (2009). Robust Optimization. Princeton University Press. ISBN: 9780691143682
Alias	IP, MIP, mixed-integer programming, mixed-integer linear programming	NLP optimization, Constrained nonlinear optimization, Smooth optimization, Doğrusal olmayan programlama	minimax optimization, worst-case optimization, Gürbüz Optimizasyon (Robust Optimization)
Correlati	4	3	5
Sintesi	Integer programming (IP), also called mixed-integer programming (MIP) when only some variables are restricted to whole numbers, is a branch of mathematical optimisation in which some or all decision variables must take integer or binary values. Building on linear programming, it was formalised through Ralph Gomory's cutting-plane method (1958) and the Land-and-Doig branch-and-bound algorithm (1960), and it has since become the standard exact framework for scheduling, assignment, routing, and resource-allocation problems.	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.	Robust optimization is a mathematical programming framework, formalised by Ben-Tal and Nemirovski in the late 1990s and made broadly tractable by Bertsimas and Sim (2004), that finds decisions guaranteed to perform acceptably under every scenario within a predefined uncertainty set — rather than assuming parameter values are known exactly. Instead of optimising for a single expected outcome, it minimises the worst-case objective across all plausible realisations of uncertain data.