The Stack Overflow podcast is back! Listen to an interview with our new CEO.

Questions tagged [terminology]

For questions about the definition or meaning of terms used within Operation Research.

Filter by
Sorted by
Tagged with
8
votes
3answers
117 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"...
10
votes
2answers
354 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({\...
14
votes
2answers
1k 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?
22
votes
4answers
1k 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 ...
25
votes
5answers
2k 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 ...
26
votes
1answer
532 views

What are 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 ...
13
votes
1answer
569 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.
11
votes
0answers
85 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) ...