Questions tagged [constraint]
For questions related to constraints, i.e. any restriction or relation a set of decision variables has to satisfy.
31
questions
6
votes
1answer
79 views
If-then constraints in MIP programming
For continuous variables $x$ and $y$, the constraints are:
...
12
votes
2answers
842 views
Is This Constraint Convex?
I have a constraint that I believe to be convex and not affine which I think means that I can implement a relaxation. I will first define the full constraint, and then build up my (informal) reasoning ...
6
votes
1answer
54 views
Optimal resource allocation - 3 step process
I have a 3 step process. Step A takes 20 min, Step B : 60 min, Step C : 20 min
Steps in production of output "news nuggets" is as below:
Step A : Do Secondary Research
Step B : Analyse the data, ...
6
votes
1answer
99 views
How To Linearize $X = \max\{x_1,x_2\}$
I am new to thinking about math programming and I have a particular constraint I am hoping to reformulate, I just don't know the proper mathematical translation for what I am hoping to do. Enforcing ...
8
votes
1answer
84 views
Constraint to state the relation between 2 binary variables
I'm trying to deal with a process planning and machine layout allocation simultaneously.
I have the following variables:
$X_p{_w}_{cj}=1$ if an operation $p$ is done by a machine $w$ with a ...
7
votes
2answers
153 views
How to linearize a constraint with max
I would like to linearize a constraint with max. I have the following constraint:
$$\max_{pcj}X_{pwcj}\leqslant L_{wk}.$$
With this constraint, I would like to ensure that for $\forall w \in W$, no ...
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"...
6
votes
1answer
75 views
Common structures in Gurobi - Python
I'm new to Gurobi in Python and I was wondering if someone knows how to code some common structures of linear constraints. Punctually, I'm trying to understand how you'll code something like the ...
8
votes
2answers
323 views
What is the standard practice in Constraint Programming modeling?
I know some general concepts regarding Constraint Programming (e.g., the ones explained in this answer). I am interested in learning how to formulate a combinatorial optimisation problem as a ...
9
votes
1answer
73 views
How to model 24 hours demand into a daily shift schedule?
I am working on a weekly staff scheduling optimization problem with 24/7 demand.
The binary decision variable is: $X_{\text{staff},\,\text{day},\,\text{shift}}$ whether to assign the staff $s$ to day ...
15
votes
2answers
183 views
Divisibility constraints in integer programming
In the study of a certain pure mathematical problem (related to infinite-dimensional Lie algebras) I found myself in a situation where it would be very desirable to be able to solve an integer ...
9
votes
1answer
117 views
Static stochastic knapsack problem: unbounded version
In the static stochastic knapsack problem (SSKP) the weights $w_i$ of the items are distributed according to a probability distribution. Each item $i \in I$ can be selected at most once.
So, ...
19
votes
4answers
895 views
Linearize or approximate a square root constraint
I encounter a nonlinear constraint that contains the square root of a sum of integer variables. Of course one could use nonlinear solvers and techniques; but I like linear programming. Are there any ...
11
votes
3answers
987 views
Soft constraints and hard constraints
The terms "soft constraints" and "hard constraints" are used in the context of optimization modeling.
Is there any standard way to figure out which is which in some of the complicated models?
9
votes
1answer
65 views
Change coefficient in PuLP
Once a model is implemented in PuLP, how do you change a coefficient (e.g., $a_{ij}$, $b_i$ or $c_j$) of a program of the from $\min\{c^{\top}x: Ax=b, x\geq0\}$?
Specifically:
How to update ...
10
votes
2answers
184 views
Fast validation of time windows in a routing problem
When solving a routing problem with time windows, unless you go for the arc-based math program that describes it, you have to check time windows "manually." For example, generating routes with any ...
4
votes
0answers
56 views
If and then constraint for a special case [duplicate]
I have the following constraint:
$$f\geq C_1\left(d-z-E_1-E_2\right)+C_2\left(E_1+E_2\right).$$
Here $f, d,z\in \mathbb{R}_{\geq 0}$ and $y\in \{0,1\}$ are variables and $C_1$, $C_2$, $E_1$, and $E_2$...
11
votes
3answers
213 views
Is my approach to my internship project good? Optimal allocation of product across stores, constrained optimization
Context: I am a CS student currently in a non-CS internship (logistics, supply chain).
My manager wants to leverage my knowledge of programming to build a program to solve the following problem:
As ...
7
votes
1answer
291 views
KKT inequality conditions
Let's say I have an objective function
$$f(x_1,x_2, \cdots, x_n)$$
and $N$ constraints
$$x_i \ge 0. $$
I am trying to solve it with KKT conditions. Now the objective function becomes
$$f(x_1,x_2,...
12
votes
1answer
419 views
How to formulate maximum function in a constraint?
How to formulate (linearize) a maximum function in a constraint? Suppose $C = \max \{c_1, c_2\}$, where both $c_1$ and $c_2$ are variables. If the objective function is minimizing $C$, then it can be ...
16
votes
2answers
145 views
Can we replace a binary variable with a continuous variable using a quadratic equality constraint?
Is it possible to replace a binary variable $x$ with a continuous variable that satisfies the quadratic equality constraint $x^2 - x=0$?
The function $f(x) = x^2 -x$ is not a convex function. Can ...
15
votes
2answers
98 views
Is the Irreducible Infeasible Subset (IIS) of an LP unique?
The IIS is a standard part of most modern solvers, but is it unique for an LP? My intuition tells me that it should be, but I could find any proof.
12
votes
1answer
112 views
Difference between lazy callbacks and using lazy constraints directly
I'm trying to use lazy constraints to solve an optimization problem. In some software such as CPLEX or GUROBI, they have some tools to handle them directly (in the original model) or using callback ...
11
votes
3answers
228 views
How to handle real-world (soft) constraints in an optimization problem?
Cross-posted at Stats.SE (aka Cross Validated)
I am working on a problem which involves optimizing for minimum power consumption in a large compressor network interconnected through pipelines (think ...
9
votes
4answers
129 views
Is there a canonical name for Score Folding (multiplying a priority soft constraint by a big weight)?
I've regularly encountered that there are too many constraints to categorize into just hard and soft constraints. For example:
Physical constraints (very hard), e.g. 1 person can only be at 1 spot ...
16
votes
1answer
178 views
What is the difference between integer programming and constraint programming?
At first glance both approaches appear to be very similar. So, I wondered where lie the major differences between integer programming and constraint programming?
11
votes
1answer
92 views
Simplest way to eliminate redundant constraints due to a new cut
I have a polyhedral set for constraining $x$:
\begin{align}
\mathcal{P} = \{x \in \mathbb{R}^n_{+} : \ Dx \leq d \}
\end{align}
where $D \in \mathbb{R}^{m \times n}, d \in \mathbb{R}^m$. I find the ...
10
votes
2answers
166 views
In an integer program, how can I “activate” a constraint only if a decision variable has a certain value?
Suppose we have the constraint
$$a_1x_1 + \cdots + a_nx_n \gtreqless b,$$
where $a_i$ and $b$ are constants and $x_i$ are decision variables. Suppose also that we want the constraint to hold if $y=1$ (...
21
votes
3answers
333 views
In an integer program, how I can force a binary variable to equal 1 if some condition holds?
Suppose we have a binary or continuous variable $x$, a binary variable $y$, and a constant $b$, and we want to enforce a relationship like
If $x \gtreqless b$, then $y = 1$.
How can we write this ...
12
votes
1answer
136 views
2 stage stochastic programming to approximate many stage problems
There are many naturally multi-stage (i.e., more than two) stochastic programming problems that are approximated by a two-stage stochastic programming model due to the complete intractability of the '...
17
votes
1answer
188 views
Working with absolute values in constraint in a LP or MILP
Having all the approaches explained in the blog called "OR in an OB World" (this address) in my mind, I would like to ask the following question:
What is the best practice to make a constraint linear ...
