New answers tagged duality
1
vote
Accepted
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 ...
3
votes
Accepted
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 ...
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 ...
Top 50 recent answers are included
Related Tags
duality × 76linear-programming × 32
convex-optimization × 13
optimization × 11
dual × 11
mixed-integer-programming × 8
column-generation × 7
nonlinear-programming × 6
lagrange-multipliers × 6
lagrangian-relaxation × 5
nonconvex-programming × 4
benders-decomposition × 4
reduced-costs × 4
integer-programming × 3
reference-request × 3
network-flow × 3
convexity × 3
simplex × 3
terminology × 3
kkt-conditions × 3
global-optimality × 3
robust-optimization × 3
optimality-conditions × 3
primal × 3
primal-simplex × 3