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
5
votes
2answers
724 views

Integer programming problem

I have the following exercise: Stockco is considering four investments. Investment 1 will yield a net present value (NPV) of \$16,000; investment 2, an NPV of \$22,000; investment 3, an NPV of \$12,...
5
votes
3answers
953 views

Solving continuous Minimax Optimization problem

I want to solve a linear programming minimax problem here mathematically without using software: $$\begin{align*} \text{min}\ \text{max} \quad & \{x_1,x_2,x_3\} \\ \text{s.t.} \...
5
votes
2answers
93 views

how to determine differents gap rate?

I found in the literature different gaps: a gap between a random solution and an exact solution a gap between the exact solution and a lower bound a gap between the exact solution and a lower bound a ...
5
votes
1answer
182 views

Trouble understanding a passage in Nonlinear Programming by Bertsekas

I am reading Nonlinear Programming by Bertsekas, and the chapter on duality starts like this: we define the primal problem as $$\begin{align*} &\min f(x)\\ &x \in X\\ &g(x) \le 0 \end{...
5
votes
1answer
121 views

Dual variables associated with same equation for different time instants

I have three equations that are essentially the same equation defined for three time instants. The equations are basically calculating the state of energy of an energy storage facility. \begin{align} ...
5
votes
1answer
396 views

How to run MOSEK solver in CVXOPT

I have written a small code to do a simple min variance optimisation using CVXOPT, you can see the whole code below By using solvers.qp(P, q, G, h, A, b) in CVXOPT ...
5
votes
2answers
81 views

Solve nonlinear programming problems practically

In an exam, I studied Theoretical approaches to converting constrained minimum problems into unconstrained minimum problems. Specifically: KKT conditions Projection Gradient Descent Penalty and ...
5
votes
1answer
110 views

0-1 knapsack with non-linear objective function

There's efficient algorithms for solving the 0-1 knapsack problems when the objective function is just a sum of profits. I am dealing with the following problem with non-linear objective function: $$\...
5
votes
2answers
322 views

Can I use 'SCIP' solver for PYOMO?

I have an MINLP problem to solve where I was initially using 'ipopt' solver but the solution was not sticking to 'binary/boolean/integer' domain type for a variable. I am not sure which free solver ...
5
votes
1answer
196 views

Column Generation algorithm for vehicle routing problem

I want to solve a VRP with a column generation algorithm. The objective of the problem is makespan minimization. In more detail, I want to minimize the arrival time of the last vehicle in the depot. I ...
5
votes
1answer
200 views

How to express this constraint?

I have the constraint \begin{align}\max&\quad\gamma\\\text{s.t.}&\quad a\ge\gamma b\\&\quad\gamma\le 1\end{align} where $\gamma$ is an optimization variable and $a$ is a function of some ...
5
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 ...
5
votes
1answer
88 views

Local minimization of a function over a line

Let $f:\mathbb{R}^n \mapsto \mathbb{R}$ be a differentiable function. Suppose $x^*$ is a local minimizer of $f$ along every line that passes through $x^*$. This means that the function $$g(\alpha) = f(...
5
votes
1answer
287 views

How is Big M calculated?

Because of excessive pollution on the Momiss River, the state of Momiss is going to build pollution control stations. Three sites (1, 2, and 3) are under consideration. Momiss is interested in ...
5
votes
1answer
110 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-...
5
votes
1answer
114 views

Which solver solves PSD constrained convex non-linear problem

I have a problem with a vector variable $w \in \mathbb{R}^n$ and a symmetric matrix variable $V \in \mathbb{R^{n \times n}}$. I am solving a problem which is roughly like: \begin{align} \begin{array}{...
5
votes
1answer
267 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 ...
5
votes
1answer
83 views

Is the order of edges in graph is changing the optimization result?

I am solving an optimization problem using Pulp and NetworkX. The problem is similar to the Minimum Vertex Set (MVS) problem. I have noticed that the optimizer is Scanning the edges according to their ...
5
votes
1answer
211 views

How to determine the size of a model?

I want to know about the number of variables and constraints of this formulation (exp: $o(n)$ variables and constraints or $o(n^2)$ ....). Is the number of variables $\mathcal O(n^3)$ because we have ...
5
votes
1answer
86 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
2answers
160 views

How to linearize a quadratic constraint to add it then via a callback function

Suppose we have a positive continuous variables $0 \le x \le UB$ where $UB$ is a known upper bound. How can we linearize the term $x^2$? Detailled problem: Suppose that via a callback we compute a ...
5
votes
2answers
122 views

Minimizing $x_1/x_2$ over a simplex in the positive orthant

I need to solve the following problem \begin{align}\min&\quad x_1/x_2\\\text{s.t.}&\quad Ax \leq b\\&\quad x > 0\end{align} where $A$ is a positive matrix. The best thing I can think ...
5
votes
2answers
68 views

AMPL implement constraint

I'm trying to implement the following in AMPL: $$ i \in [N], j \in[N] \backslash \{i\}, t \in [T] $$ I have so far written the following: ...
5
votes
1answer
86 views

How to linearize difference of absolutes?

How to linearize difference of absolutes? $$|a|\ge k|b|$$ where $a,b$ are variables and $k$ is a constant.
5
votes
0answers
219 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 ...
4
votes
3answers
701 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 ...
4
votes
3answers
751 views

Shortest path problem

At the beginning of year 1, a new machine must be purchased. The cost of maintaining a machine $i$ years old is given in Table 5. The cost of purchasing a machine at the beginning of each year is ...
4
votes
2answers
657 views

Shortest path problem with boxes

A company sells seven types of boxes, ranging in volume from 17 to 33 cubic feet. The demand and size of each box is given in the following table. The variable cost (in dollars) of producing each box ...
4
votes
2answers
138 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.
4
votes
2answers
281 views

What are the most useful evaluation metrics when comparing the performance of different model formulations

Suppose you are writing a paper about a certain new problem class. You have certain problem instances of different size (real-world as well as random) given. You developed different integer ...
4
votes
1answer
423 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} & & &...
4
votes
1answer
155 views

Issue in solving a large scale MIQP problem

I am solving a large scale MIQP optimisation problem at each step of a model predictive control problem. The problem description is as below. \begin{align} \min_{u} \quad (x_{k}&-x_\text{ref})^{T}...
4
votes
2answers
139 views

Is there efficient way to deal with division by zero?

I am trying to solve an optimization problem in which there is an objective function in the following form: \begin{equation}f(x, y)=x+\left(\frac{1}{y}\right)\end{equation} Where, $x,y$ are positive ...
4
votes
1answer
87 views

Analytically finding the maximizer of a trace optimization problem

$A \in \mathbb{R}^{m \times n}$ is an arbitrary data matrix. Moreover, $w \in \mathbb{R}^m$ is a data vector which is a probability vector, i.e., $w\succeq 0, \sum_{i=1}^m w_i = 1$. I have a ...
4
votes
1answer
325 views

How to read a solution file (.sol) in cplex python API?

I've been to trying to read a .sol file in cplex python API before solving the problem but couldn't find any command to do so. There are analogous commands for this ...
4
votes
1answer
242 views

Scheduling Optimization Problem

I want to solve below optimization problem. This is scheduling problem where I seek to complete as many of the jobs $\xi_l$ (objective function and constraint 1), with $T_C$ being the last time until ...
4
votes
1answer
137 views

How/when can we use MINLP engines instead of linearizing MP models?

Nowadays, mathematical programming solvers have been frequently used to solve lots of practical/academic problems. Many of these might be interpreted as a MIP or MINLP to represent a specific problem (...
4
votes
1answer
80 views

Which method to use to solve this multi-objective conflicting objectives

I have the following multiobjective problem. I need to minimize the user-perceived latency while doing so aggressively minimizing user-perceived latency generates large switching cost (Reconfiguration ...
4
votes
2answers
134 views

Constraint $x'Ax = 0$, where $x$ and $A$ are both optimization variables

I'm trying to solve the following optimization problem: $$ \min_{x, \phi} x \quad \text{s.t.} \quad \sum_{s,t = 1}^n \left(m_{s,t} x -v_{s,t} \right)\phi_s \phi_t = 0 , \quad \lVert \phi \rVert = 1$$ ...
4
votes
2answers
194 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 ...
4
votes
1answer
108 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 ...
4
votes
1answer
96 views

Linear objective function with power term in constraint

Given $n$ variables $x_{i}$ where $i\in [0,n)$, denoted as a vector $x$, given a linear objective function that we want to minimize $c^\top x$ with 2 constraints: $\sum x_{i}^{2} < n+1$ $\sum\log(...
4
votes
2answers
102 views

How to deal with an optimization problem that have a sum of nonlinear functions of Z as a constraint when Z is the quantity to be minimized?

I have to minimize a quantity $Z$ subject to the following constraints: $$ w_1 + w_2 + w_3 = 1 \tag{1}$$ $$ \frac{f_1(w_1 Z) + f_2(w_2 Z) + f_3(w_3 Z)}{Z} \ge k \tag{2}$$ where $k$ is a known ...
4
votes
1answer
61 views

How do you turn an abstract set constraint into equality constraints?

I am reading from Nonlinear Programming by Bertsekas, and in the section on ADMM, he says: Consider the problem $$\text{min} \sum _{i=1} ^ m f_i(x)$$ $$\text{s.t. }x \in \cap _{i = 1}^m X_i,$$ where $...
4
votes
1answer
100 views

maximum number of BoolVar 's before or-tools is no longer feasible to use

The standard nurse scheduling problem which is used as an example for OR-Tools (see for example https://developers.google.com/optimization/scheduling/employee_scheduling) attempts to assign boolean ...
4
votes
1answer
91 views

Radial unboundedness vs convexity

We have a simple problem, namely minimizing: $$f(x) = x_1^2 + x_2^2 - x_1.$$ The gradient is $$\nabla f(x) = \begin{bmatrix} 2x_1 - 1 \\ 2x_2 \end{bmatrix},$$ hence the unique stationary point is: $...
4
votes
2answers
87 views

Let $A\in\mathbb{R}^{m\times n},c\in\mathbb{R}^n$. Show that exactly one of the following two systems is feasible:

Let $A\in\mathbb{R}^{m\times n},c\in\mathbb{R}^n$. Show that exactly one of the following two systems is feasible: $Ax\geq0,x\geq0,c^Tx>0$ $A^Ty\geq c,y\leq0$ Assume that A is feasible meaning $...
4
votes
1answer
84 views

Bioinformatics / Genomics Optimization Problems?

I am a third year bioinformatics student and would like to apply my knowledge from an introductory course in Optimization Methods to some problems in the field of genomics or bioinformatics. Do you ...
4
votes
1answer
68 views

the set of optimal solutions of a linear programming (LP) problem as a mapping of right-hand side

Consider a linear programming (LP) problem \begin{align} M(b) \in \arg\min_x \{ c^\top x : Ax=b, x \ge 0 \}. \end{align} Suppose the LP is feasible and bounded for all values of $b$. We know that $M(...
4
votes
1answer
151 views

Combinatorial Optimisation, Allocation problem

I am trying to solve a problem (in pyspark/ python) where I need to find two distinct values to allocate, and how to allocate them in a network of stores. The two distinct values can only be integer ...

1
3 4
5
6 7
9