Originally posted by: SystemAdmin
[DanielJunglas said:]
You can
[list]
[li]Use dual simplex to solve your LP without the conditional constraints.[/li]
[li]Get the optimal solution.[/li]
[li]Add all additional constraints violated by the optimal solution to your problem.[/li]
[li]Use dual simplex to re-optimize the modified problem.[/li]
[li]Repeat until none of the additional constraints are violated.[/li]
[/list]
This is essentially what happens if you use the cut callback in MIPs.
#CPLEXOptimizers#DecisionOptimization