Skip to main content

Questions tagged [terminology]

For questions about the definition or meaning of terms used within Operations Research. Do not use this tag for questions about notation.

Filter by
Sorted by
Tagged with
2 votes
0 answers
41 views

Minimizing sum(abs(Ax-c)) for binary decision variables - terminology and methods?

My problem requires choosing a fixed number of vectors from a large set of vectors such that the sum of these vectors is close to some known target vector. That is, given known parameters: $$ l, m, n \...
G_B's user avatar
  • 1,847
1 vote
1 answer
44 views

Terminology for "One-time" vs. "Continuous Tasks"

I'm working on task scheduling for satellite constellations, and I'm trying to determine if there are any keywords related to a certain distinction in task allocation problem that I'm seeing. In many ...
jgholder's user avatar
  • 111
2 votes
1 answer
579 views

Is mathematical programming synonymous with algebraic modelling?

Based on my on-again-off-again internet search of optimization problems over the past few years, the two terms seem to cover largely the same way of representing problems, if not the identically. I'm ...
user2153235's user avatar
2 votes
0 answers
28 views

What are process-based DES and event-based DES, exactly?

I have occasionally heard the terms "process-based DES" and "event-based DES". For example, from SimPy: SimPy is a process-based discrete-event simulation framework based on ...
Galen's user avatar
  • 141
4 votes
2 answers
587 views

Using the "true" sample rather than sampling from a distribution - is there a name for this?

I have drawn X-many samples from a population. I want to use this data to drive inputs for a Monte Carlo simulation (or similar). The population may be a real world measurement, or it could be the ...
P. Hopkinson's user avatar
1 vote
2 answers
177 views

Minimal infeasible constraint set

Many modern SAT and SMT solvers offer a feature where they can report why a problem is unsatisfiable, something called an "unsat core." Are there any optimization solvers (in my case, ...
Nate's user avatar
  • 113
0 votes
2 answers
71 views

What is the official terminology concerning different types of racks?

Thanks to a previous question, I know about this PDF file, containing a lot of terms concerning supply chain management. This list is quite elaborated, but I'm now more specifically looking for ...
Dominique's user avatar
2 votes
1 answer
64 views

Does this kind of "partition" have a name?

Consider a convex polyhedron $A$. Assume we have subsets $A_1,\ldots,A_n$ of $A$ that are themselves covex polyhedra and are mutually disjoint except maybe sharing an edge, and that their union gives $...
pele's user avatar
  • 123
2 votes
2 answers
195 views

How do you pronounce MILP? [closed]

Apologies for the english question, but I believe this forum will be better suited for answering my question. I am trying to decide whether I should use A MILP or An MILP, as I have seen both cases in ...
J. Dionisio's user avatar
2 votes
2 answers
108 views

Is there a name for this type of integer programming?

Let $x_i$ be a decision variable, and let $c_i$ be the coefficient for the decision variable $x_i$. An integer programming problem is where the goal is to: $\text{maximize} \quad \sum_i c_ix_i$ $\text{...
user avatar
4 votes
1 answer
300 views

Endowment of an agent

I was going through the Shapley-Folkman-Starr Lemma (https://simons.berkeley.edu/sites/default/files/docs/3605/simons2.pdf) and I came across the term "endowment" of an agent. My assumption ...
user12632521's user avatar
2 votes
1 answer
112 views

What is a transport order in supply chain management?

I arrived at this site as a result of this question. Last week, two colleagues were having a discussion about the term "Transport Order" in supply chain management. (Is it a recursive ...
Dominique's user avatar
3 votes
2 answers
282 views

Related to Lagrangian dual

In my research class our professor discuss a paper wherein the solution is obtained via a Lagrangian duality. The original problem is given below: minimize $t$ subject to $\sum_{j \in \mathcal{M_i}}\...
chaaru's user avatar
  • 33
2 votes
2 answers
65 views

Is there a concept of shrinking the consideration set?

I don't know the terminology, so the title can be confusing. Let me explain here. We would like to find the optimal solution in $S$. Suppose some external theory suggests that there must be an ...
Ypbor's user avatar
  • 163
3 votes
0 answers
101 views

What is the general name (e.g. facility location problem) for this problem (if any)?

I would like to know if there is a general name for the following problem: We will open several facilities. Each facility has an associated facility type. There exists a given number of facility ...
Displayed_Name's user avatar
9 votes
2 answers
1k views

"Partial" Lagrangian Dual in LP

Consider the optimization problem \begin{align}\label{opt-lp}\tag{Primal} \begin{array}{cl} \underset{x \in \mathbb{R}^n}{\text{minimize}} & c^\top x \\ \text{subject to} & Ax = a \\ & Bx =...
independentvariable's user avatar
3 votes
2 answers
139 views

Defining multiple constraints compactly where some index combinations are not defined

My question is about how usual/strange defining constraints compactly can be (in a scientific document). Formally, I define constraints $$f_{i,j,k}(x) \leq 0, \quad \forall i \in [I], \ \forall j \in [...
independentvariable's user avatar
8 votes
1 answer
184 views

Name for this ILP problem type

I am considering automating testing of down-stream testing of packages that depend on other packages. There are test sets $T_1,\ ..., T_n$ which can be tested or not tested, which each have a time ...
worldsmithhelper's user avatar
2 votes
2 answers
676 views

Best way to solve a optimization problem with no objective function?

I have a MILP but fixed the objective function, so at each iteration is constant.Therefore, I solve a constraint satisfaction problem. Is there an algorithm to solve this kind of problem fast? I have ...
orpanter's user avatar
  • 517
3 votes
2 answers
150 views

Scheduling of planned orders while respecting certain stock levels

I am searching for the academic name of the problem of computing a valid schedule for planned order. More precisely, The problem consists of: list of orders O, available vehicle per day K, and the ...
MarcM's user avatar
  • 133
6 votes
3 answers
3k views

Is a mathematical programming problem with no objective function an optimization problem?

I have a "mathematical programming" (MP) problem that does not have an objective function. Namely, I want to find a vector that satisfies all constraints (no optimization involved, right?). ...
jesús garcía's user avatar
7 votes
4 answers
2k views

What's the name of a finite-capacity bin packing problem trying to minimize the weight of the heaviest bin?

I have a fixed number of bins which are themselves weightless. Each bin can hold only a fixed amount of weight. Not all bins have the same capacity. I also have a fixed number of objects each of which ...
Richard's user avatar
  • 543
3 votes
1 answer
269 views

Logical / combinatorial Benders Decomposition vs Cutting plane method

Is there a difference between logical and combinatorial Benders Decomposition and the cutting plane method? My understanding is that for all of these techniques, there is a MIP and based on solutions ...
PSLP's user avatar
  • 2,401
4 votes
1 answer
80 views

Does the facility layout problem with zero and one matrices have a specific name?

I have an facility layout problem where the flow between any two departments is either zero or one. Also the distance between each location pair has the same nature (zero or one). I am curious whether ...
OR Junior's user avatar
  • 521
5 votes
1 answer
161 views

Combined arc capacity constraints in network flows

Consider the network flow polyhedron for a directed graph $G = (N, A)$. Along with the standard flow-balance and single-arc capacity constraints, we are faced with additional constraints which enforce ...
dxb's user avatar
  • 1,799
4 votes
1 answer
63 views

What is the name of the graph where any edge is part of a cycle?

I wonder if there is a special category for this kind of graphs, I am thinking of a bidirectional graph but it would also be interesting in the cases when it is undirected. I am thinking of something ...
jeroaranda's user avatar
6 votes
1 answer
107 views

Terminology for continuous planning, real-time planning, non-disruptive replanning, overconstrained planning, backup planning etc

In the past 14 years, when dealing with enterprise planning challenges, I've encountered multiple challenges of "repeated planning" and "planning agility" in general. At some point,...
Geoffrey De Smet's user avatar
2 votes
0 answers
80 views

Analysis model vs. executable implementation of model?

In my post-graduate research and subsequent career in operational analysis, the difference between following seems to have become clearer with the years: (1) a model of a problem or operations in the ...
user2153235's user avatar
6 votes
2 answers
199 views

What is the definition for an integer-friendly constraint?

I have seen some papers claiming that their proposed model is integer-friendly. I would like to get more information about what type of constraints we can call integer-friendly. Probably, it can be ...
Mostafa's user avatar
  • 2,104
4 votes
1 answer
1k views

What is the meaning of monotone hazard rate (MHR) distribution?

It might be somewhat irrelevant to this forum but I think that many people here are familiar with this concept. I have seen that many papers assume that customers' valuation ($F$) is a monotone hazard ...
Amin's user avatar
  • 2,160
17 votes
2 answers
3k views

Dual bounds of integer programming problems

I often read in papers when branch-and-X algorithms are used to solve mixed integer programming problems, that the lower bound (in the minimization case) obtained from solving a linear programming ...
Djames's user avatar
  • 1,143
8 votes
3 answers
858 views

Difference between "Optimization" and "Constrained Optimization"?

(Another OR noob question) As I'm trying to learn about OR and Optimization methods for work, I'm having a hard time understanding the difference between "Optimization" and "Constrained Optimization"...
Skander H.'s user avatar
  • 2,139
10 votes
2 answers
477 views

Geometric programming: Why are the constraints defined to be less than/equal to 1?

In a simple convex optimisation problem, the standard form is given by \begin{align}\min_{\bf x}&\qquad f({\bf x})\\\text{s.t.}&\qquad g_i({\bf x})\le 0,\quad i=1,\cdots,m\\&\qquad h_j({\...
TheSimpliFire's user avatar
  • 5,412
15 votes
2 answers
2k views

Polyhedra, Polyhedron, Polytopes and Polygon

About Polyhedra, Polyhedron, Polytopes and Polygon, what do they mean in the context of linear programming and what is the difference between them?
A.Omidi's user avatar
  • 8,950
22 votes
4 answers
3k views

What is a solution?

Consider a standard optimization problem: Minimize an objective function with respect to constraints. My question is: What does the term "solution of the optimization problem" mean? At first I ...
Dirk's user avatar
  • 381
31 votes
5 answers
5k views

Optimization terminology: "Exact" v. "Approximate"

In optimization literature, I frequently see solution methods termed "exact" or "approximate". (I use the term "method" here because I suspect exactness, or its lack, is a function of both algorithm ...
prubin's user avatar
  • 39.3k
40 votes
1 answer
2k views

What are common and not so common abbreviations in Operations Research?

Many abbreviations are used in Operations Research. For example, we have abbreviations for problem classes (LP, MIP), solution methods (IPM), and specific problems (TSP, VRP). Which abbreviations are ...
Kevin Dalmeijer's user avatar
15 votes
1 answer
1k views

What is quadratization?

In the context of discrete optimization, what exactly does it mean to "quadratize" a function? The term seems to be used mainly by operations researchers, in my experience.
Nike Dattani's user avatar
  • 1,278
15 votes
1 answer
269 views

Has the expressibility of 'non-integrality testing' as extension to MILP been studied before?

It turns out that extending MILP with any of the constraints $y=\lfloor x\rfloor$, $y=\lceil x\rceil$, $0 < x$, or $x\notin \mathbb{Z}$ is 'equally hard'. (see my answer here, and below) ...
Discrete lizard's user avatar