Two general methods for inverse optimization problems

DOI10.1016/S0893-9659(98)00151-7zbMath0935.90023OpenAlexW2002305755MaRDI QIDQ1808980

Zhang, Jianzhong, Chao Yang

Publication date: 25 November 1999

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0893-9659(98)00151-7

zbMATH Keywords

inverse optimizationellipsoid methodrevised simplex methodcolumn generation methoduniform LP model

Mathematics Subject Classification ID

Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items

Some inverse min-max network problems under weighted \(l_1\) ans \(l_{\infty}\) norms with bound constraints on changes ⋮ Branch-and-bound algorithms for the partial inverse mixed integer linear programming problem ⋮ Computation of inverse 1-center location problem on the weighted trapezoid graphs ⋮ Inverse multi-objective combinatorial optimization ⋮ The inverse \(\{0,1\}\)-knapsack problem: theory, algorithms and computational experiments ⋮ Heuristic algorithms for the inverse mixed integer linear programming problem ⋮ Inverse max + sum spanning tree problem by modifying the sum-cost vector under weighted \(l_\infty \) norm ⋮ An inverse optimization approach for a capacitated vehicle routing problem ⋮ A class of bottleneck expansion problems ⋮ The optimization of road building schedule based on budget restriction ⋮ Cutting plane algorithms for the inverse mixed integer linear programming problem ⋮ Inverse problems of submodular functions on digraphs ⋮ Some reverse location problems ⋮ Some inverse optimization problems under the Hamming distance

Cites Work

• Unnamed Item
• On an instance of the inverse shortest paths problem
• An inverse problem of the weighted shortest path problem
• Calculating some inverse linear programming problems

This page was built for publication: Two general methods for inverse optimization problems