Skip to main content

New answers tagged

1 vote

Enforcing Order in a Linear Programming Question

For simplicity, I will omit the $t$ index. You want to enforce $$x_1+x_2+x_3\ge d \implies x_4=0.$$ Equivalently, enforce the contrapositive $$x_4>0 \implies x_1+x_2+x_3< d.$$ Let $\epsilon$ be ...
RobPratt's user avatar
  • 32.8k
2 votes

My Professor couldn't complete the model for this optimization problem. how do i model this problem?

There are at least two approaches that can be used to model this. The more obvious one uses binary variables $x_{wsd}$ equal to 1 if and only if worker $w$ is scheduled in slot $s$ on day $d.$ Some of ...
prubin's user avatar
  • 39.6k
2 votes

Constrained optimization with heuristic algorithm in actual production

Besides the mentioned answer, there are many cases in which either a simple rule or an algorithm, or a heuristic can solve a practical problem in an efficient manner and still without defining any ...
A.Omidi's user avatar
  • 8,960
2 votes

Constrained optimization with heuristic algorithm in actual production

For genetic algorithms, there is a variant called random key genetic algorithms (and a variant of that called biased random key genetic algorithms -- the bias part being a tweak to the evolutionary ...
prubin's user avatar
  • 39.6k
4 votes
Accepted

Modeling $-\ln(1 - w \cdot \sigma(x))$ as disciplined convex programming

It doesn't look particularly convex: https://www.desmos.com/calculator/v17plvovb8.
Henrik Alsing Friberg's user avatar
7 votes
Accepted

Is 0-1 knapsack problem still NP-Hard (1) with an equality constraint and (2) when all the weights in the constraint are equal to one?

The general case where not all weights are equal to one, is ${NP}$ hard, as the subset sum problem reduces to it with a constant objective function. If all weights $w_i$ are equal to one, the problem ...
Sune's user avatar
  • 6,647
4 votes
Accepted

Avoid double counting in objective function for a maintenance scheduling problem

You want to minimize $\sum_i \sum_t r_t \max_j x_{ijt}$. To linearize this objective, introduce binary decision variable $y_{it}$ to represent $\max_j x_{ijt}$, impose constraints $x_{ijt} \le y_{it}$...
RobPratt's user avatar
  • 32.8k
1 vote
Accepted

choose constraint from IIS to build penalty function

I think that, when selecting constraints to relax (with penalties), you should look at the IIS from the perspective of the final decision maker. Which constraints do they think absolutely must be ...
prubin's user avatar
  • 39.6k
0 votes

Improve a heuristic to solve the MS-RCPSP

It is very hard problem and very limited number of papers can really help. Probably exact solvers using optional intervals are a way to go with a few thousands of tasks.
gregy4's user avatar
  • 189
3 votes
Accepted

How is this function piece-wise linear?

For a linear function $g(a)$, the function $g(a)^+=\max(g(a),0)$ is piecewise linear (with two pieces). Also, finite combinations (weighted sums) of piecewise linear functions are piecewise linear. ...
RobPratt's user avatar
  • 32.8k
1 vote

Improve a heuristic to solve the MS-RCPSP

Check this review. There are several papers referenced that could help you to find a good method to solve it. This is also a good paper to check.
Enrique Gabriel Baquela's user avatar
0 votes

Identifying the minimum number of required machines to schedule jobs

This thread is already a year old, but let me add a comment anyways. The machine minimization problem is actually quite well studied, but some interesting open problems remain. The problem: There is ...
schedxyz's user avatar
2 votes
Accepted

Inconsistent solutions to linear optimal control problem

One of the necessary conditions is $L_u = 0$. If you assume that $\mu(t) = 0$, it follows from $L_u = \mu_x(t) + \mu(t) = 0$ that $\mu_x(t) = 0$. Because $u(t)$ can take any value when $\mu_x(t) = 0$, ...
Kevin Dalmeijer's user avatar

Top 50 recent answers are included