8
votes
Is there a canonical name for Score Folding (multiplying a priority soft constraint by a big weight)?
It's not exactly the same thing, but very close: in goal programming, using a weighted combination of the deviations from goals is often called "Archimedean" (as in "Archimedean" goal programming, or ...
- 28.9k
7
votes
Is there a canonical name for Score Folding (multiplying a priority soft constraint by a big weight)?
The act of moving soft constraint into the objective function using penalties is closely related to Lagrangian Relaxation and Lagrangian Multipliers.
The method penalizes violations of [...] ...
- 2,685
6
votes
Accepted
Difficulties with Finding a Proper Penalty Value for the Progressive Hedging Algorithm
This problem is addressed in some detail in Section 2.1 of the paper Progressive hedging innovations for a class of stochastic mixed-integer resource allocation problems by Watson and Woodruff (a non-...
- 1,957
4
votes
Is there a canonical name for Score Folding (multiplying a priority soft constraint by a big weight)?
I’m not sure I’ve heard a canonical name, but that sounds like a multi-objective optimization problem where you’re minimizing the sum of weighted deviations. The weights are based on the constraint ...
- 1,307
4
votes
Is there a canonical name for Score Folding (multiplying a priority soft constraint by a big weight)?
One common way I've seen in the literature to deal with such cases is to multiply the priority constraint by a big weight and add it into the fitness function alongside the lower priority constraint.
...
- 2,042
3
votes
Extract info from Gurobi binary variables during run-time
We can't modify the optimisation problem while it's being solved. What you could try instead is to solve once (maybe with a lax convergence criterion), add/update the constraints based on that ...
- 11.1k
Only top scored, non community-wiki answers of a minimum length are eligible