Questions tagged [optimization]

For questions involving mathematical problems that aim to minimize or maximize some objective function, possibly subject to one or more constraints.

Filter by
Sorted by
Tagged with
4
votes
2answers
185 views

Output of binary variable greater than one

I am working on a shipping demurrage problem that uses a binary variable to denote the date a specific vessel can be loaded (I have been kindly helped by Wesley on OR before with this). I am confident ...
3
votes
2answers
118 views

Limit number of switches in employee scheduling problem

Here is a scheduling problem I need to solve. Given the demand for 2 positions in 1 week with 3 shifts per position, I need to allocate the employees accordingly with some extra operational ...
2
votes
0answers
41 views

Algorithm for Trainyard Marshall optimization problem

The problem I am trying to solve is the 2014 RAS problem. The link is the following The problem Trains come to the humpyard where each compartment of a train gets humped or disassembled and then each ...
3
votes
1answer
108 views

How to optimize with “if” constraints

The minimizing problem is the following : $$ \underset{w}{\operatorname{argmin}} \sum_{i=1}^{n}\left[w_{i}\times (\frac{Vw}{\sigma})_{i} - b_{i}\right]^{2}$$ with $V$ a $n\times n$ matrix (covariance ...
1
vote
1answer
41 views

How to deal with the sub-problem with zero reduced cost in D-W decomposition

The specific linear programme has an optimal solution as $x_1 = 0.66$, $x_2 = 1.33$, $x_3 = 12.2$, $x_4 = 0.0$ and the objective value is $33.3$. While the problem is solved by D-W decomposition ...
2
votes
1answer
144 views
2
votes
1answer
111 views

Representing Date Variables in Pulp

I am working on an optimisation problem that involves minimising shipping demurrage. I am struggling to model how to represent the difference, (x-y) between dates where the ship is ready to be loaded ...
2
votes
0answers
40 views

Decision-making algorithm for dynamic load balancing

I'm researching a subject of balancing the load between two black-box systems (with some twists). I thought that I could record latest response time log from each of those systems and process such a ...
3
votes
2answers
544 views

Fast algorithm for Transportation Problem in Python?

Transportation Problem can be solved with simplex algorithm, but it's time demanding. I'm wondering if there exist a specific Python-implemented algorithm with low complexity. Thanks
3
votes
1answer
124 views

Resource constraint with MIP model

My question is how to model a resource constraint with MIP model (how should I modify it?) A factory is making blocks. If there is space left at that time, the block can be assembled. (If the factory ...
11
votes
1answer
1k views

An approximate answer to the right question or an exact answer to the wrong question

There is a quote from John Tukey in one of his papers on data analysis Far better an approximate answer to the right question, which is often vague, than an exact answer to the wrong question, ...
4
votes
1answer
221 views

Creating an Optimisation Problem to Optimise Water Flow

A water tank needs to be refilled with an electric pump when the water level gets below a certain level. The pump can operate at variable flow rates. Further, there is a time-variant electric billing ...
1
vote
1answer
119 views

Pulp Python: How to formulate a time-based variable for shipping demurrage

I am working on a shipping optimisation problem that aims to minimise demurrage charges as a result of low/insufficient inventory. I have daily vessel requirement (sales) data in the format ...
6
votes
1answer
121 views

Convert summation of min functions into linear constraints for optimization

I have the following optimization problem: $$ \mbox{maximize } j^{*} \mbox{ subject to:} \sum_{j^{*}\leq j\leq J} \min({\bf A}_j,{\bf B}_j) \geq \lambda, \lambda \in \mathbb{R} \mbox{ and } {\bf A}_j,{...
1
vote
1answer
127 views

How to allow multiple assignments for jobs in Hungarian Algorithm?

In the Hungarian Algorithm, the assignment for a bipartite graph considers the restriction of assigning a single job to a single person for example. Can this restriction be relaxed? I would like to ...
8
votes
2answers
2k views

How to convince people that OR can help them?

When talking to people who are not familiar with what OR is and what it is about, and you want to convince them that it might be useful for them/their industry, what do you tell them in order to ...
2
votes
1answer
50 views

Defining and comparing utilization rates for delivery service

I'm currently working on a case for a food delivery service and wondered whether my notion of "driver utilization" makes any sense. My data set contains an hourly overview of the number of active ...
6
votes
1answer
205 views

Can Operations Research applications scale?

What do I mean by scaling? Let's say you developed a software for an operations research application for an industry client. Now you want to make a product out of this and sell it for other clients. ...
5
votes
0answers
109 views

What is the difference between root relaxation and LP relaxation

(I apologize. I saw this question but, I do not know these may be the same or not.) I am trying to solve a MIP problem and have an issue about that. The problem's LP relaxation has the objective ...
3
votes
1answer
39 views

Is Multidisciplinary Design Optimization / Collaborative Optimization used anywhere outside of the Mechanical Engineering context?

I recently stumbled across the concept of Multidisciplinary Design Optimization (MDO), sometimes referred to as Multi-Disciplinary Optimization or Multidisciplinary Systems Design Optimization (MSDO), ...
11
votes
3answers
625 views

How can I estimate the monetary savings of a operation research application?

Developing operation research applications for industry clients is often very costly since it is in my experience often a custom special development for the client. The cost of developing a running ...
3
votes
1answer
74 views

Pyomo add constraint error: Rule failed when generation expression for constraint

I am trying to solve a model with Pyomo and struggling with indexing. Below is a simple problem instance, where you can also see the error. The message is straightforward and self-explanatory but ...
2
votes
4answers
77 views

Linearity of an optimization problem which comprises the product of variables with constant values from a non-linear function

In a mathematical integer optimization problem, if the objective function is represented as $\sum x_k \cdot M_k$, where $M_k$ is a non-linear function whose value is known and just plugged in to the ...
21
votes
10answers
3k views

What are Operations Research problems which occur in everyday life?

What are Operations Research problems which occur in your everyday life? Things that come to mind are for example: driving to work: shortest path problem packing your backpack for vacation: ...
1
vote
0answers
75 views

Simplex - Network flow problem : Arc from 1 to P with infinite capacity

The Network - Maximum flow problem below aims to find the maximum flow using simplex method : With the LP as follow : LP : \begin{Bmatrix} Z(Max) = \sum_{i=1}^{m} fi \\ Af =0 \end{Bmatrix} ...
6
votes
1answer
304 views

Is there a name for this variation of the assignment problem?

I'm given two matrices: $A$, an $n\times n$ adjacency matrix of a graph. The graph is unweighted, undirected and has no self-edges or multi-edges. $X$, an $n\times n$ symmetric matrix of edge ...
4
votes
1answer
75 views

Clustering a large ride-matching problem

Background: We are solving a large scale vehicle to person ride-matching problem. The problem is essentially simple (match every person with a vehicle, if possible), yet the problem size is quite ...
5
votes
0answers
114 views

What are Operations Research applications for 'morally discussable causes'?

Out of curiosity, since I read this question What are Operations Research applications for 'good causes'? and thought it might be a good addition to it. What are Operations Research ...
8
votes
1answer
57 views

Covering problem on a network (?)

I have this problem described in natural language, and I was wondering whether it is relatable to any known problem. I have a directed acyclic graph. Each node can host a "probe". If node $i$ hosts ...
1
vote
0answers
62 views

Ways to improve lower bounds while solving MIPs

What are the ways to improve lower bounds while solving a minimization problem (MILP)?
5
votes
1answer
103 views

Interpretability Vs Accuracy in Operations Research and Management Science Community

This question might be somewhat general and not completely relevant to this forum but I think here is the most relevant place to ask the question. Currently, deep learning, RL and generally black-...
2
votes
0answers
62 views

Density Optimization by Fitting an Circle to a Field - Monte Carlo Method

Given: I have 2D non-parametric formula that provides instantaneous intensity at certain (x,y) location. Required: I want to en-circle a region where the density is high via optimization. In other ...
3
votes
1answer
99 views

How to transform these conditional constraints to linear integer ones in a more efficient way?

The conditional constraints A and B can be transformed to a set of linear integer constraints as follows: A) $\text{if} \ x_1=0 \ \text{then} \ d_1=1 \ \text{else} \ d_1= 0\\ x_1\in {\rm I\!R}^{\geq ...
19
votes
7answers
3k views

What kind of optimization problems are solved most often in practice?

I think that the shortest path problem is probably the problem that is solved most often. But if we move to problems where we need more complicated solvers, like Gurobi, Cplex, and Baron? What are the ...
24
votes
9answers
3k views

What are Operations Research applications for 'good causes'?

I am looking for applications of OR for good causes, possibly with some literature. I intend a good cause loosely defined in the sense that the scope is that of improving the well-being of others, e.g....
3
votes
0answers
47 views

What are the efficient ways to model this scheduling problem and ways to improve running time

There are $N - \{1 \ldots N\}$ jobs, each with processing time $p_j$, to be scheduled on $M - \{1 \ldots M\}$ machines over span of $D - \{1 \ldots D\}$ days and while working $T - \{1 \ldots E \ldots ...
1
vote
2answers
114 views

Pulp: slack variable to identify & measure extent infeasible in supply problem

I am currently modelling a supply problem that attempts to optimise a rail schedule which moves products from a production plant, to a warehouse to satisfy sales. The model is working fine (thanks in ...
4
votes
3answers
348 views

Branch and bound algorithm programming code

I want to solve an integer programming problem using the branch and bound method, but I'm having trouble finding the programming code. From what I saw, almost all algorithms use it for traveling ...
26
votes
7answers
9k views

MATLAB vs. Python in industry

I am a beginning PhD student in math, and I would like to focus on optimization. I am learning programming for the first time, and I have written out some rudimentary optimization algorithms in both ...
4
votes
2answers
137 views

Maximum Flow Problem : Can someone refer me to accessible valuable resources

Can anyone please refer/suggest me some accessible papers, works, books, websites, documentation related to The Maximum Flow Problem.
3
votes
1answer
86 views

What kind of scheduling problem is this?

I am trying to develop algorithm to solve following basic version of the problem. 1) I would like to know what this problem is called in literature so that I can look it up 2) What are efficient ...
2
votes
0answers
52 views

Weapon Target Assignment Problem + Time Windows

So I am very familiar with the WTAP it the static case. What I am wondering, is there a formulation that has "time windows" as well? Let's say you have some weapons and some targets, you know the ...
3
votes
1answer
156 views

Cplex : The cutting stock problem

The problem below aims to minimize the cutting leftovers from each cut : A company manufactures desks for kids gardens and primary schools, colleges and high schools. The leg of these deks all have ...
7
votes
1answer
1k views

How to use the least number of colours to colour different routes of a bus route such that no two intersecting routes will have the same colour

I would like to know of a method in which if provided say 10 routes with details regarding which route intersects with which another route, we can use the least number of colours to colour the routes, ...
1
vote
1answer
146 views

How do I solve this Optimization problem?

Optimization of a simple expansion problem minimise: $$ \sum_{t=1}^{5}\left[\sum_{i=1}^{2}x_{i,t}CC_i\left(\frac{1+EIC}{1+r}\right)^t+UE_t*C_{UE}\right] $$ subject to: $$ 0 \leq x_{i,t} \leq 5 \\ ...
8
votes
3answers
928 views

Open source MILP solver for quick “good enough” solution

I have a problem that I have already posted elsewhere in OR.stack, but the question is focused around a large binary MILP (about 1 million decision variables). Ultimately, I am more time constrained ...
1
vote
1answer
34 views

Enforcing discontinuous range for a variable

I want to enforce the following ranges for a set of variables, where the ranges for each variable are discontinuous. For example, I have two sets of ranges for each variable, \begin{align}\sf LB_1 &...
10
votes
1answer
282 views

What are the pros and cons of LocalSolver?

LocalSolver is a company which provides a global optimization solver, combining exact and heuristic techniques. The benchmarks on their website are quite impressive. For example, they claim they can ...
4
votes
1answer
102 views

Mobile Sensor Placement for Optimal Coverage

I have come across the paper that deals with spatial positioning of mobile sensors to optimally detect sound source, or position mobile cellphone towers to maximize the coverage. The region $Q$ is ...
2
votes
1answer
81 views

Specific usecase of two-phase simplex algorithm

The problem below aims to find to most optimal way to transport the fuel : A company Er must transport a type of fuel from its two refineries Ra and Rb to its two points of sale PV1 and PV2. The ...

1
2
3 4 5
7