New answers tagged

1 vote

Is there a way to find out which original constraints are violated when a feasibility cut is generated in benders?

I assume that by "violated" you mean "cannot be satisfied". It is not typically the case that a single constraint will be infeasible; rather, it is usually a subset of constraints ...
prubin's user avatar
  • 37.9k
3 votes

Reducing optimality to feasibility in non-linear programs

You displayed the KKT conditions of the LP. For any convex optimization problem in which the objective and constraint functions $f_i(x)$ for constraints $f_i(x) \le 0$ are continuously differentiable ...
Mark L. Stone's user avatar
0 votes

How do you get the primal solution of an LP from the dual solution?

If in primal problem the variable $\mathbf x$ was a vector of dimension $n$ and constraints were made of $m+p$ equations, in dual problem we should have $n$ equations in $m+p$ variables. It is common ...
marco tognoli's user avatar

Top 50 recent answers are included