विधियों की तुलना करें
चुनी हुई विधियों की आमने-सामने समीक्षा करें; भिन्नता वाली पंक्तियाँ रेखांकित हैं।
| मजबूत मिश्रित-पूर्णांक प्रोग्रामिंग× | स्टोकेस्टिक मिक्स्ड-इंटीजर प्रोग्रामिंग× | |
|---|---|---|
| क्षेत्र | अनुकरण | अनुकरण |
| परिवार | Process / pipeline | Process / pipeline |
| उद्भव वर्ष≠ | 1998–2004 | 1990s–2000s |
| प्रवर्तक≠ | Ben-Tal & Nemirovski; Bertsimas & Sim | Birge, J. R.; Louveaux, F.; Sen, S. |
| प्रकार≠ | Deterministic robust reformulation of MIP under uncertainty | Stochastic optimization model |
| मौलिक स्रोत≠ | Bertsimas, D., Sim, M. (2004). The price of robustness. Operations Research, 52(1), 35–53. DOI ↗ | Birge, J. R., & Louveaux, F. (1997). Introduction to Stochastic Programming. Springer Series in Operations Research. New York: Springer. ISBN: 9780387982175 |
| उपनाम | RMIP, Robust MIP, Uncertain MIP, Robust MILP/MIQP | SMIP, Stochastic MIP, Mixed-Integer Stochastic Programming, SMILP |
| संबंधित≠ | 4 | 5 |
| सारांश≠ | Robust Mixed-Integer Programming (RMIP) combines mixed-integer programming with robust optimization to find solutions that remain feasible and near-optimal despite uncertain parameters. Instead of assuming fixed data, it protects decisions against adversarial or worst-case realizations of uncertain inputs, using an explicit uncertainty set to control the degree of conservatism while preserving the combinatorial structure of integer decisions. | Stochastic Mixed-Integer Programming (SMIP) is an optimization framework that finds the best mix of binary, integer, and continuous decisions when key parameters — costs, demands, capacities — are uncertain and modeled as probability distributions over a set of scenarios. It extends classical MIP by embedding scenario trees or expected-value objectives that hedge against uncertainty while respecting combinatorial constraints. |
| ScholarGateडेटासेट ↗ |
|
|