विधियों की तुलना करें
चुनी हुई विधियों की आमने-सामने समीक्षा करें; भिन्नता वाली पंक्तियाँ रेखांकित हैं।
| पूर्णांक प्रोग्रामिंग× | कन्स्ट्रेंट प्रोग्रामिंग× | लक्ष्य प्रोग्रामिंग× | |
|---|---|---|---|
| क्षेत्र≠ | अनुकूलन | अनुकूलन | निर्णयन |
| परिवार≠ | Process / pipeline | Process / pipeline | MCDM |
| उद्भव वर्ष≠ | 1958 | 2006 | 1955 |
| प्रवर्तक≠ | Ralph Gomory (cutting planes, 1958); land-and-doig branch-and-bound (1960) | Rossi, van Beek & Walsh | Charnes, A., Cooper, W. W. |
| प्रकार≠ | Mathematical optimisation — exact combinatorial method | Declarative combinatorial optimization | Multi-objective optimisation — weighted/lexicographic goal deviation minimisation |
| मौलिक स्रोत≠ | Wolsey, L.A. (1998). Integer Programming. Wiley. ISBN: 9780471283669 | Rossi, F., van Beek, P., & Walsh, T. (Eds.). (2006). Handbook of Constraint Programming. Elsevier. ISBN: 978-0-444-52726-4 | Charnes, A., Cooper, W. W. (1955). Optimal estimation of executive compensation by linear programming. Management Science DOI ↗ |
| उपनाम≠ | IP, MIP, mixed-integer programming, mixed-integer linear programming | Constraint Satisfaction Programming, Constraint-Based Optimization, Kısıt Programlama, CSP Optimization | — |
| संबंधित≠ | 4 | 3 | 8 |
| सारांश≠ | 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. | Constraint Programming (CP) is a declarative optimization paradigm in which a problem is formulated as a set of variables, finite domains, and constraints, and a solver systematically searches for assignments that satisfy all constraints. Formalized comprehensively by Rossi, van Beek, and Walsh in their 2006 Handbook of Constraint Programming, CP unifies propagation-based pruning with intelligent backtracking search to tackle combinatorial problems across scheduling, planning, and configuration domains. | GOAL-PROGRAMMING (Goal Programming — Minimise deviations from multiple aspiration levels) is a ranking multi-criteria decision-making (MCDM) method introduced by Charnes, A., Cooper, W. W. in 1955. It turns a decision matrix of alternatives scored on multiple criteria into a structured, reproducible result. |
| ScholarGateडेटासेट ↗ |
|
|
|