Setting parameters by example. (English) Zbl 1027.90092
Summary: We introduce a class of “inverse parametric optimization” problems, in which one is given both a parametric optimization problem and a desired optimal solution; the task is to determine parameter values that lead to the given solution. We describe algorithms for solving such problems for minimum spanning trees, shortest paths, and other “optimal subgraph” problems and discuss applications in multicast routing, vehicle path planning, resource allocation, and board game programming.
MSC:
90C31 | Sensitivity, stability, parametric optimization |
49N45 | Inverse problems in optimal control |
90C35 | Programming involving graphs or networks |
68Q25 | Analysis of algorithms and problem complexity |