A tag is a keyword or label that categorizes your question with other, similar questions. Using the right tags makes it easier for others to find and answer your question.
For questions about the theoretical runtime needed for solving computational problems, often measured in the size of the input. This includes questions about whether polynomial time algorithms exist, …
Questions relevant to the PuLP modelling framework in Python
For questions related to the simplex method for linear programming (LP), which solves LPs optimally by moving iteratively from in corner point of the feasible region to a better one.
Questions related to the IBM Decision Optimization CPLEX (docplex) which is designed for modeling and solving optimization problems in Python.
For questions about mathematical models and algorithms for optimizing inventories.
For questions related to the use of a "big M" (large constant) in a mathematical modeling context, either in the objective function (to initialize the simplex method) or in constraints (to formulate l…
For questions on constraints controlled by binary variables.
For questions related to convex functions and convex sets, especially as they relate to optimization problems.
Questions relating to the Google CP-SAT solver, available through OR-Tools.
For questions about solving Operations Research problems using the C++ programming language.
For questions related to the knapsack problem that seeks to find the number of each item to include in a limited container (in an integer knapsack or whether to include an item in a binary knapsack),…
For questions related to the branch-and-bound method for integer programming problems, which recursively divides the solution space and identifies upper and lower bounds on the optimal objective funct…
For questions asking for real-world applications of specific concepts.
For questions about dynamic programming, a mathematical optimization technique where the optimal solution to the problem is found by breaking it down to simpler sub-problems and solved recursively.
For questions related to commercial or open-source computer software used for operations research problems.
For questions related to optimization problems for choosing the optimal locations of facilities such as warehouses, factories, fire stations, etc.
CVXPY is a Python-embedded modeling language for convex optimization problems.
For questions about solving Operations Research problems using the R programming language.
For questions about the definition or meaning of terms used within Operations Research. Do not use this tag for questions about notation.
Queueing theory is the mathematical study of waiting lines, or queues. A queueing model is constructed so that queue lengths and waiting time can be predicted. Queueing theory is generally considered …
For questions related to GAMS (General Algebraic Modeling System), a high-level modeling system for mathematical optimization.
For questions related to machine learning (ML), a type of algorithm that attempts to "learn" how to perform a task without being given an explicit set of rules to follow in order to perform it. Questi…
For questions related to the use of computer models to estimate performance measures for complex systems, typically under uncertainty.
For questions related to the algebraic modeling language AMPL.
For questions on the set of points that satisfy a finite set of linear inequalities.
For questions about solving Operations Research problems using the Java programming language.
For questions related to Operations Research approaches for modeling, managing, or optimizing supply chains, systems designed to move goods from where they are produced to where they are consumed.
For questions about obtaining upper or lower bounds for certain values, usually for an optimization objective.
For questions about solving Operations Research problems using Matlab programming language.
For questions on a method that transforms a subset of the linear inequalities of a linear program into an equivalent representation by its extreme points and rays; this generally introduces a large nu…
Disciplined convex programming (DCP) is a system for constructing mathematical expressions with known curvature from a given library of base functions.
For questions related to the use of Excel and the Excel solver. The Excel solver is an add-in that allows the solution of linear programming problems, such as product mix problems (whether maximizatio…