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
12
votes
2answers
119 views

Run repeatable numerical tests in the cloud

In numerical tests of optimization algorithms, one often reads "We used a XY computer with X GB RAM for the experiments". Usually, when I want to compare my results with theirs, I do not have an XY ...
17
votes
6answers
2k views

Infeasibility in mathematical optimization models

Sometimes, when solving mathematical optimization models (especially MIPs), they may be infeasible. Is there any comprehensive method to deal with the infeasibility conditions? (especially in complex ...
21
votes
5answers
2k views

Validation and verification of mathematical models

Within the subject of simulation I have found some literature on validation and verification (e.g. Sargent's paper). My question is, what techniques do you use to validate and verify your mathematical ...
13
votes
7answers
863 views

What are the examples (applications) of the MIPs in which the objective function has nonzero coefficients for only continuous variables?

I'm specifically looking for real applications of the following form of MIP: $$\max\,Cx$$ subject to: \begin{align}Ax +By &= D\\Ax &= E\\By &= F\\ x &\ge 0\\ y &\in \mathbb{...
8
votes
1answer
161 views

Model Update for Data Driven Real Time Process Optimization

The question I am about to ask is not a technical one but rather based on following a correct approach, which I am sure would be helpful to many. I am currently working on a project which involves ...
21
votes
3answers
2k views

Are valid inequalities worth the effort given modern solvers?

In Laurence Wolsey's Integer Programming[1], he presents a well-known procedure for deriving valid inequalities (VI) suitable for integer and mixed integer linear problems (see Section 8.3, and also ...
6
votes
1answer
2k views

How to linearize min function as a constraint?

I'm trying to solve an optimization problem including following constraint, and I need to linearize it in a maximization nonlinear programming model. Please help me to reformulate it with mixed ...
6
votes
2answers
270 views

How to add Binary Variable with condition in LP

Notation $\text{src}_{h,s},\text{dst}_{h,s},\text{ch}_{h,s}$ are constants. $a_{h,s},x_{i,j,s}$ are binary variables. $\text{wt}_{h,s}$ are continuous variables. Problem \begin{align}\min.&\...
6
votes
2answers
816 views

Linearization of objective function

Notation $\text{src}_{h,s},\text{dst}_{h,s},\text{ch}_{h,s}$ are constants. $a_{h,s},x_{i,j,s}$ are binary variables. $\text{wt}_{h,s}$ are continuous variables. Problem \begin{align}\min.&\...
-3
votes
2answers
197 views

Some theories and laws of Operations Research? [closed]

Can I know some theories and laws of Operation Research which has being widely used nowadays?
6
votes
2answers
553 views

How to modify EMSR when capacity for each fare class is different

In the normal EMSRa and EMSRb (Expected Marginal Seat Revenue) algorithms, each fare class is utilizes exactly 1 unit of capacity (for example, one seat on a plane). But I have a similar problem for ...
8
votes
1answer
398 views

Finding minimum time for vehicle to reach to its destination

Given a set of Vehicles with source and destination I need to find the minimum time of travel for all the vehicles, there are also some charging stations and its necessary for vehicles to charge 1 ...
11
votes
3answers
5k 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?
6
votes
1answer
70 views

Labour Model - Resource Allocation based off Product Forecasts

at my company, we have a product level forecast that we run through a model which pulls out an hours number for our retail outlets. We do this by binning various products into categories and give ...
9
votes
2answers
368 views

What is this type of scheduling problem called?

I am currently working on software that deals with a specific type of scheduling problem, and I want to improve the scheduling algorithms that it uses. However, when I tried to research algorithms ...
4
votes
1answer
478 views

Having negative value for non basic variable gives a infeasible solution in simplex method?

I try to solve the following linear program with the simplex method: $$ \begin{alignedat}{4} \max & \quad & x_1 & {}-{} & 2x_2\\ \text{subject to} & & &...
8
votes
1answer
257 views

Disciplined convex programming representation of $x\cdot\min x$

How can I reformat the problem below to follow DCP rules? DCP rules are Disciplined Convex Programming Rules that allow convex programs to be solved. DCP Is there a way to reformat the problem ...
2
votes
1answer
114 views

Reduction of Unnecessary Parameters and Variables in an MIP

Let's observe an example constraint: $\sum \limits^E_{e\ \in \ A_a \ \cap \ B_b \ \cap \ C_c} x_{e,a,b,c} \geq n_{a,b,c} \; \; \; \forall a \in A,b \in B,c \in C$ with $e \in E$ an element and $A_a$ ...
8
votes
1answer
377 views

How to formulate this scheduling problem efficiently?

Let there be $N$ users with individual demands (of some items). Some users can have higher demands while the others can have lower demands. There are exactly $N$ service points. There is a one-to-one ...
22
votes
4answers
2k views

OR-backed serious games

A "serious game" is a game (usually a simulation) designed for a primary purpose other than pure entertainment. Games like the beer game or the fresh connection can be considered serious games serving ...
1
vote
0answers
137 views

Optimal value exceeds actual value for a minimization problem [closed]

I am solving a nonlinear numerical optimization problem in Pyomo using Scip as a solver. The goal is to minimize a certain objective function. For certain input conditions, I notice that the solver ...
15
votes
4answers
734 views

Optimization models for portfolio optimization

What are the mainstream models for portfolio optimization? We have Markowitz mean-variance model and CVaR-based models (e.g., max return subject to a CVaR constraint). What else is out there in terms ...
-3
votes
1answer
87 views

Geometric interpretation of a Linear problem with bounded variables

I have a question of how to make a geometric interpretation of this problem \begin{eqnarray} \mbox{max} & z = 3x_1+x_3 \\ s.a: & \\ & \begin{array}{cc} x_1+2x_2+x_3+x_4& =...
22
votes
4answers
4k views

What instances can be solved today by modern solvers (pure LP)?

I have found a PowerPoint presentation in which the presentor Hall claims instances could be of the size of 108 in variables and constraints to be solved today. I assume that he meant sparse problems. ...
10
votes
2answers
1k views

Infinite horizon versus finite horizon MDP

When can we approximate a finite horizon MDP with infinite horizon? Can we use infinite horizon stochastic shortest path problem on a directed acyclic graph?
17
votes
3answers
782 views

What are some real-world applications of QUBO?

QUBO (Quadratic Unconstrained Binary Optimization) is the minimization of a quadratic function of binary variables. It has been used for computer vision, Ramsey numbers, factoring numbers, the ...
11
votes
3answers
291 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 ...
6
votes
1answer
69 views

Minimizing a project costs through nonlinear optimization

I have a project and I want to minimize the costs. I am are responsible for the inspection of 1000 miles of sewer grid in Canada. My goal is to provide time high quality inspection reports. I tried to ...
7
votes
1answer
356 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,...
19
votes
5answers
3k views

Ordered list of OR journals

Is there any compact resource that includes a list of all academic journals in the OR/MS space, ranked by journal importance? Although there are some helpful features offered by publisher websites ...
5
votes
1answer
307 views

Python PuLP - Unable to Model Non-Square Matrix

I am having issues with setting up constraints using both input arrays from excel and variable arrays within PuLP. It appears the model only works with square matrices and my final code has a matrix ...
17
votes
3answers
421 views

As an Operations Research professional, how is your time divided when working on an optimization project?

When working on an optimization project, what is the typical time division (in percentage) between the various tasks that you have to work on: Problem understanding/definition (figuring out what is ...
19
votes
3answers
252 views

Variable bounds in column generation

Consider the set covering problem \[ \begin{align} \min&\ \sum_{j=1}^nc_jx_j\\ s.t.:&\ \sum_{j=1}^na_{ij}x_j\geq 1,\quad \forall i=1,\dots,m\\ &\ 0\leq x_j \leq 1 \end{align} \] ...
10
votes
1answer
130 views

Algorithmic gap for Hochbaum's (greedy) algorithm for (metric) uncapacitated facility location

In Jain et al. (2003)1, at the bottom of page 801, they construct an instance of (metric) uncapacitated facility location for which they claim the greedy (Hochbaum's) algorithm has gap $\Omega\left(\...
10
votes
1answer
138 views

Is it possible (or straightforward) to define many secondary problems in bilevel programming?

I am new to bilevel programming. I was wondering whether it is possible (or straightforward) to formulate a bilevel problem in which there are many secondary-level problems? An example might be a ...
16
votes
2answers
218 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 ...
14
votes
3answers
138 views

Strategic planning based on average values

If you have strategic planning problems like hub location problems, the input data often consists of average values for shipping volumes etc. When planning capacities, it is risky to ignore the ...
18
votes
2answers
353 views

Guidelines for Linear Optimization approaches?

When solving a Linear Optimization model (or Linear Program), there are a lot of solution approaches. Just to name a few: Primal Simplex Dual Simplex Ellipsoid Method (as if) ...
-8
votes
1answer
134 views

Why the optimal value that minimizes a function does not satisfy condition?

I have found a solved example of A Stochastic Two-Period Model with No Setup Cost in the book Operational Research by Hillier, 7th edition, that has a lot of complicated calculations to arrive to the ...
12
votes
1answer
642 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 ...
12
votes
3answers
330 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 ...
20
votes
1answer
363 views

Usages of logarithmic mean in optimization

I have recently learned about the logarithmic mean $$\frac{x-y}{\ln(x)-\ln(y)},\quad x,y > 0.$$ It is used a lot in chemical engineering optimization models e.g. see slide 15 of Developing ...
4
votes
1answer
111 views

One and two period policy for inventory situation

The following exercise is in the book Operational Research by Hillier, 7th edition, page 978. In this exercise $p$ and $p$ are the stockout and holding cost parameters, respectively. $𝑦^0_i$ is the ...
-6
votes
2answers
210 views

How to decide to write an objective function?

I'm working on this problem: In the Njaba river basin, the available water was allocated for the purposes of consumption, irrigation, and electric power supply among three communities. The water ...
14
votes
2answers
336 views

How can I approximate a chance constraint in a computationally tractable way?

I want to solve an optimization model that contains a constraint like $$ \Pr[F(x,\xi)\leq0]\geq1-\varepsilon $$ where $x$ are my decision variables, $\xi$ is a random vector, and $\varepsilon\in(0,1)$ ...
23
votes
4answers
418 views

How to determine if a given problem seems to be a good fit to be solved using combinatorial Benders decomposition

Combinatorial Benders decomposition is a mathematical programming technique consisting into dividing a problem into a master problem and a sub problem. The master problem is solved to optimality (or ...
15
votes
3answers
334 views

Benchmark problems for scenario-based stochastic optimization

$\newcommand{\E}{\mathbb{E}}$I am working on numerical algorithms for solving convex large-scale multistage scenario-based problems and I am looking for some standard benchmarks problems. I have so ...
27
votes
4answers
335 views

How to avoid having your optimization models rusting?

When designing optimization models for external organizations, I have witnessed the following: We design an optimization model for a given problem. We fine-tune it based on a portfolio of ...
24
votes
15answers
2k views

Recommended books/materials for practical applications of Operations Research in industry

I have a Masters' degree in Mathematics. I've very fair understanding of methods and techniques of Operations Research. I am looking for a good book/material where I can see a lot of examples on Math ...
12
votes
1answer
256 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 ...

1
6 7 8
9
10