The following pages link to The inverse optimal value problem (Q1769073):
Displaying 17 items.
- Inverse linear programming with interval coefficients (Q495129) (← links)
- Data-driven inverse optimization with imperfect information (Q681497) (← links)
- A penalty function method based on bilevel programming for solving inverse optimal value problems (Q710987) (← links)
- A penalty function method for solving inverse optimal value problem (Q939520) (← links)
- Branch-and-bound algorithms for the partial inverse mixed integer linear programming problem (Q1945502) (← links)
- The lower bounded inverse optimal value problem on minimum spanning tree under unit \(l_{\infty}\) norm (Q2022333) (← links)
- Capacitated inverse optimal value problem on minimum spanning tree under bottleneck Hamming distance (Q2045028) (← links)
- Weak optimal inverse problems of interval linear programming based on KKT conditions (Q2057406) (← links)
- Combinatorial algorithms for solving the restricted bounded inverse optimal value problem on minimum spanning tree under weighted \(l_\infty\) norm (Q2088862) (← links)
- Inverse optimal value problem on minimum spanning tree under unit \(l_{\infty}\) norm (Q2228401) (← links)
- Inverse optimization: towards the optimal parameter set of inverse LP with interval coefficients (Q2358169) (← links)
- Some inverse min-max network problems under weighted \(l_1\) ans \(l_{\infty}\) norms with bound constraints on changes (Q2385479) (← links)
- Two-stage network constrained robust unit commitment problem (Q2514777) (← links)
- Complexity of some inverse shortest path lengths problems (Q3057164) (← links)
- Disjoint Bilinear Optimization: A Two-Stage Robust Optimization Perspective (Q5057987) (← links)
- Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets (Q5084616) (← links)
- The restricted inverse optimal value problem on shortest path under \(l_1\) norm on trees (Q6102183) (← links)
