The inverse optimal value problem for linear fractional programming
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1302174 (Why is no real title available?)
- scientific article; zbMATH DE number 7009371 (Why is no real title available?)
- A note on linearized reformulations for a class of bilevel linear integer problems
- A penalty function method based on bilevel programming for solving inverse optimal value problems
- A polyhedral characterization of the inverse-feasible region of a mixed-integer program
- Cutting plane algorithms for the inverse mixed integer linear programming problem
- Exact solution approaches for a class of bilevel fractional programs
- Fractional 0-1 programming: applications and algorithms
- Inverse Mixed Integer Optimization: Polyhedral Insights and Trust Region Methods
- Inverse Optimization
- Inverse combinatorial optimization: a survey on problems, methods, and results
- Inverse conic programming with applications
- Inverse integer programming
- Inverse optimal value problem on minimum spanning tree under unit \(l_{\infty}\) norm
- Linear-fractional programming. Theory, methods, applications and software.
- Programming with linear fractional functionals
- Quantile inverse optimization: improving stability in inverse linear programming
- Real Analysis and Applications
- The inverse optimal value problem
- The restricted inverse optimal value problem on shortest path under \(l_1\) norm on trees
- \(NP\)-hardness of linear multiplicative programming and related problems
This page was built for publication: The inverse optimal value problem for linear fractional programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6988151)
