Inverse multi-objective combinatorial optimization

Inverse multi-objective combinatorial optimization consists of finding a minimal adjustment of the objective functions coefficients such that a given set of feasible solutions becomes efficient. An algorithm is proposed for rendering a given feasible solution into an efficient one. This is a simplified version of the inverse problem when the cardinality of the set is equal to one. The adjustment is measured by the Chebyshev distance. It is shown how to build an optimal adjustment in linear time based on this distance, and why it is right to perform a binary search for determining the optimal distance. These results led us to develop an approach based on the resolution of mixed-integer linear programs. A second approach based on a branch-and-bound is proposed to handle any distance function that can be linearized. Finally, the initial inverse problem is solved by a cutting plane algorithm.

[1]  Xavier Gandibleux,et al.  A survey and annotated bibliography of multiobjective combinatorial optimization , 2000, OR Spectr..

[2]  Andrew J. Schaefer,et al.  Inverse integer programming , 2009, Optim. Lett..

[3]  Meir J. Rosenblatt,et al.  Generating the Discrete Efficient Frontier to the Capital Budgeting Problem , 1989, Oper. Res..

[4]  Hans Kellerer,et al.  Approximating Multiobjective Knapsack Problems , 2002, Manag. Sci..

[5]  M. Padberg.  Linear Optimization and Extensions , 1995 .

[6]  Lizhi Wang,et al.  Cutting plane algorithms for the inverse mixed integer linear programming problem , 2009, Oper. Res. Lett..

[7]  Richard E. Wendell,et al.  Efficiency in multiple objective optimization problems , 1977, Math. Program..

[9]  Michael M. Kostreva,et al.  Relocation problems arising in conservation biology , 1999 .

[10]  Ravindra K. Ahuja,et al.  Inverse Optimization , 2001, Oper. Res..

[11]  Siming Huang,et al.  Inverse Problems of Some NP-Complete Problems , 2005, AAIM.

[12]  Elena Deza,et al.  Encyclopedia of Distances , 2014 .

[13]  Matthias Ehrgott,et al.  Multicriteria Optimization , 2005 .

[14]  K. Bhaskar.  A Multiple Objective Approach to Capital Budgeting , 1979 .

[15]  Larry Jenkins.  A bicriteria knapsack program for planning remediation of contaminated lightstation sites , 2002, Eur. J. Oper. Res..

[16]  Philippe L. Toint,et al.  On an instance of the inverse shortest paths problem , 1992, Math. Program..

[17]  R. S. Laundy,et al.  Multiple Criteria Optimisation: Theory, Computation and Application , 1989 .

[18]  Gwo-Hshiung Tzeng,et al.  A MULTIOBJECTIVE PROGRAMMING APPROACH FOR SELECTING NON-INDEPENDENT TRANSPORTATION INVESTMENT ALTERNATIVES , 1996 .

[19]  Jianzhon Zhang,et al.  Two general methods for inverse optimization problems , 1999 .

[20]  Clemens Heuberger,et al.  Inverse Combinatorial Optimization: A Survey on Problems, Methods, and Results , 2004, J. Comb. Optim..

[21]  Zhenhong Liu,et al.  A General Model of Some Inverse Combinatorial Optimization Problems and Its Solution Method Under l∞ Norm , 2002, J. Comb. Optim..

[22]  Ravindra K. Ahuja,et al.  Solving Inverse Spanning Tree Problems Through Network Flow Techniques , 1999, Oper. Res..

[23]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.