Community Digest

Top new questions this week:

Integer column generation without branch & price

Consider the following situation. I have an integer program which I want to solve using column generation. After a suitable decomposition, the master problem has decision variables that select the ...

column-generation dantzig-wolfe-decomposition branch-and-price  
user avatar asked by Curious Score of 10
user avatar answered by Kuifje Score of 9

Nonlinear optimization with constraint involving long product of optimization variables

I solve a nonlinear optimization problem of the form \begin{align} &\max x_0 \text{ such that } \\ &\left[ \sum_{j=0}^N \left(\alpha_j x_0^{j} \prod_{k=3}^j x_k \right)\right]^2 + \left[ \...

optimization nonlinear-programming  
user avatar asked by Dan Doe Score of 7
user avatar answered by Erwin Kalvelagen Score of 5

Additional resources for this type of problem formulation

I'm working on a problem with the following formulation: \begin{align} \min&\quad\sum_{i \in N} \sum_{j \in J} V_{ij}x_{ij} \\ \text{s.t.}&\quad \sum_j x_{ij} = 1 \quad \forall i \in N\\ &...

mixed-integer-programming modeling graphs  
user avatar asked by Bob Jeans Score of 5
user avatar answered by Erwin Kalvelagen Score of 5

Graph coloring problem while counting cliques

Let $G$ be a graph with a set of nodes $V$ and a set of edges $E$. Let $G'$ be a graph with the same set of nodes $V$ but a second set of edges $E'$. For a set of nodes $X\subset V$, we denote $f(X)$ ...

combinatorial-optimization constraint-programming graphs  
user avatar asked by Jin Kazama Score of 5

Geometric Programming with Simple Affine Equality Constraint

Consider a Geometric Program (GP), $$ \begin{array}{cl} \operatorname{minimize} & f_{0}(x) \\ \text { subject to } & f_{i}(x) \leq 1, \quad i=1, \ldots, m, \\ & g_{i}(x)=1, \quad i=1, \...

optimization cvxpy geometric-programming  
user avatar asked by Apprentice Score of 4
user avatar answered by ErlingMOSEK Score of 3

Software for Feasibility Problems

I face a feasibility problem of type $$ c_i(\boldsymbol x) \leq 0, i = 1, \dots, \mathcal{I} \\ c_e(\boldsymbol x) = 0, e = 1, \dots, \mathcal{E} $$ where $\mathcal{I} + \mathcal{E} \gg \text{dim}(\...

nonlinear-programming constraint-programming software feasible-points  
user avatar asked by Dan Doe Score of 3

Reformulating undirected to directed edges for MCF

As stated in this paper, there is a technique to reformulate a multi-commodity flow problem (MCF) with undirected edges to its equivalent version with directed edges. By quoting them: The ...

graphs network-flow  
user avatar asked by Daniele Cuomo Score of 3
user avatar answered by David Torres Score of 3

Greatest hits from previous weeks:

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?

optimization modeling constraint  
user avatar asked by A.Omidi Score of 12
user avatar answered by dxb Score of 23

Are there any COVID-19 (coronavirus) related optimization problems with input datasets that we can "crowd solve"?

Is anyone aware of a medicine/vaccine related challenges with a good problem definition and some available input datasets, ideally related to COVID-19? What kind of constraint solving challenges would ...

practical-or medical-application  
user avatar asked by Geoffrey De Smet Score of 41
user avatar answered by Sebastiaan van den Broek Score of 17

List of Implementations for common OR problems

For the TSP there famously is the concord solver ( which is argubly the fastest exact solver for the TSP. There are many other problems that also show ...

algorithms online-resources software vehicle-routing implementation  
user avatar asked by PSLP Score of 23
user avatar answered by Geoffrey De Smet Score of 23

How Close Is Linear Programming Class to What Solvers Actually Implement for Pivot Algorithms

As part of a final project for my linear programming course, I have been asked to discuss implementations of pivot algorithms, including which combinations of the ideas we have talked about in class ...

linear-programming solver  
user avatar asked by Sean Kelley Score of 14
user avatar answered by Mark L. Stone Score of 21

No executable found for solver 'ipopt

I know that there are some questions concerning this type of error, for example, this link. I first installed the latest version of ipopt through command line into my Pyomo environment and got the &...

optimization python pyomo modeling-languages  
user avatar asked by Sik Sik Score of 1
user avatar answered by Sik Sik Score of 4

Are programming languages necessary/useful for operations research practitioner?

This semester I will start teaching Programming in Python to Master students in Supply Chain Management. I would like to start the first lesson with "Why learning programming languages will be useful ...

applications software  
user avatar asked by Atilla Ozgur Score of 19
user avatar answered by Antarctica Score of 28

Can we consider the (Famous) "Trolley Problem" as an Optimization Problem?

In the (famous) Trolley Problem ( - a runaway train is out of control and unfortunate people are stuck on two different railway tracks. The railway ...

user avatar asked by stats_noob Score of 9
user avatar answered by Sune Score of 37

Can you answer these questions?

Programming product of variables in r

I am trying to model a MILP, where in the objective, the product of two variables is introduced. This is solved through the introduction of a new variable according to the following logic: "...

user avatar asked by user9867 Score of 1

Determining the number of nodes within a cycle for an MILP problem

I have a MILP problem that requires knowing the number of nodes within a cycle (there will be multiple depending on inputs). I believe this will involve tracing nodes/values within cycles using the ...

optimization mixed-integer-programming gurobi matlab  
user avatar asked by user9899 Score of 2

Simplification of nonlinear constraint for optimization

I solve a nonlinear optimization problem with constraint $$ \sum_{j=1}^S \ln \Bigg( \Big(1 -x_j c_k + y_j d_k\Big)^2 + \Big( x_j d_k + y_j c_k \Big)^2 \Bigg) \leq 0, \: k = 1, \dots , K $$ where the ...

optimization constraint  
user avatar asked by Dan Doe Score of 2
You're receiving this message because you subscribed to the Operations Research community digest.
Unsubscribe from this community digest       Edit email settings       Leave feedback       Privacy
Stack Overflow

Stack Overflow, 110 William Street, 28th floor, New York, NY 10038