Abstract
Given the costs and a feasible solution for a finite-dimensional linear program (LP), inverse optimization involves finding new costs that are close to the original and that also render the given solution optimal. Ahuja and Orlin employed the absolute sum norm and the maximum absolute norm to quantify distances between cost vectors, and applied duality to establish that the inverse LP problem can be formulated as another finite-dimensional LP. This was recently extended to semi-infinite LPs, countably infinite LPs, and finite-dimensional conic optimization problems. These works provide sufficient conditions so that the inverse problem also belongs to the same class as the forward problem. This paper extends this result to conic LPs in potentially infinite-dimensional Banach spaces. Moreover, the paper presents concrete derivations for continuous conic LPs, whose special cases include continuous linear programs and continuous conic programs; normed cone programs in Banach spaces, which include second-order cone programs as a special case; and semi-definite programs in Hilbert spaces. These derivations reveal the sharper result that, in each case, the inverse problem belongs to the same specific subclass as the forward problem. Instances where existing forward algorithms can then be adapted to solve the inverse problems are identified. Results in this paper may enable the application of inverse optimization to as yet unexplored areas such as continuous-time economic planning, continuous-time job-shop scheduling, continuous-time network flow, maximum flow with time-varying edge-capacities, and wireless optimization with time-varying coverage requirements.
Similar content being viewed by others
References
Ahmadi, A.A., El Khadir, B.: Time-varying semi-definite programs. https://arxiv.org/pdf/1808.03994.pdf, August 2018
Ahuja, R.K., Orlin, J.B.: Inverse optimization. Oper. Res. 49(5), 771–783 (2001)
Aliprantis, C.D., Border, K.C.: Infinite-Dimensional Analysis: A Hitchhiker’s Guide. Springer, Berlin (1994)
Alizadeh, F., Goldfarb, D.: Second-order cone programming. Math. Program. 95(1), 3–51 (2003)
Anderson, E.J.: A Continuous Model for Job-Shop Scheduling. PhD thesis, University of Cambridge, Cambridge, UK (1978)
Anderson, E.J., Nash, P.: Linear Programming in Infinite-Dimensional Spaces: Theory and Applications. Wiley, Chichester (1987)
Anderson, E.J., Nash, P., Perold, A.F.: Some properties of a class of continuious linear programs. SIAM J. Control Optim. 21(5), 758–765 (1983)
Anderson, E.J., Philpott, A.B.: A continuous-time network simplex algorithm. Networks 19(4), 395–425 (1989)
Aubin, J.-P., Frankowska, H.: Set-valued analysis. USA, reprint edition, Birkhäuser, Boston, MA (2009)
Ayer, T.: Inverse optimization for assessing emerging technologies in breast cancer screening. Ann. Oper. Res. 230(1), 57–85 (2015)
Bampou, D., Kuhn, D.: Polynomial approximations for continuous linear programs. SIAM J. Optim. 22(2), 628–648 (2012)
Beil, D.R., Wein, L.M.: An inverse optimization based mechanism to support a multiattribute rfq process. Manag. Sci. 49(11), 1529–1545 (2003)
Bellman, R.E.: Bottleneck problem and dynamic programming. Proc. Natl. Acad. Sci. 39(9), 947–951 (1953)
Bertsimas, D., Gupta, V., Paschalidis, I.C.: Inverse optimization: a new perspective on the Black–Litterman model. Oper. Res. 60(6), 1389–1403 (2012)
Billingsley, P.: Probability and Measure. Wiley, New York (1995)
Bonnans, J.F., Shapiro, A.: Perturbation Analysis of Optimization Problems. Springer Series in Operations Research. Springer, New York (2000)
Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge, UK (2004)
Burton, D., Toint, P.L.: On an instance of inverse shortest path problems. Math. Program. 53(1–3), 45–61 (1992)
Burton, D., Toint, P.L.: On the inverse shortest path algorithm for recovering linearly correlated costs. Math. Program. 63(1–3), 1–22 (1994)
Carr, S., Lovejoy, W.: The inverse newsvendor problem: choosing an optimal demand portfolio for capacitated resources. Manag. Sci. 46(7), 912–927 (2000)
Chan, T.C.Y., Craig, T., Lee, T., Sharpe, M.B.: Generalized inverse multi-objective optimization with application to cancer therapy. Oper. Res. 62(3), 680–695 (2014)
Chan, T.C.Y., Kaw, N.: Inverse optimization for the recovery of constraint parameters. https://arxiv.org/abs/1811.00726 July 2019
Chan, T.C.Y., Lee, T.: Trade-off preservation in inverse multi-objective convex optimization. Eur. J. Oper. Res. 270(1), 1 (2018)
Chan, T.C.Y., Lee, T., Craig, T., Sharpe, M.B.: Determining objective function weights in prostate IMRT using inverse optimization. Med. Phys. 38(6), 3687 (2011)
Chan, T.C.Y., Lee, T., Terekhov, D.: Inverse optimization: closed-form solutions, geometry and goodness of fit. Manag. Sci. 65(3), 1115–1135 (2019)
Conway, J.B.: A course in operator theory. Graduate Studies in Mathematics, vol. 21. American Mathematical Society, Providence, RI, USA (2000)
Dial, R.: Minimal-revenue congestion pricing part I: a fast algorithm for the single-origin case. Transp. Res. Part B: Methodol. 33(3), 189–202 (1999)
Dial, R.: Minimal revenue congestion pricing. Part II: an efficient algorithm for the general case. Transp. Res. Part B Methodol. 34(8), 645–665 (2000)
Erkin, Z., Bailey, M.D., Maillart, L.M., Schaefer, A.J., Roberts, M.S.: Eliciting patient’s revealed preferences: an inverse Markov decision process approach. Decis. Anal. 7(4), 358–365 (2010)
Faybusovich, L., Tsuchiya, T.: Primal-dual algorithms and infinite-dimensional Jordan algebras of finite rank. Math. Program. 97(3), 471–493 (2003)
Fleischer, L., Sethuraman, J.: Efficient algorithms for separated continuous linear programs: the multicommodity flow problem with holding costs and extensions. Math. Oper. Res. 30(4), 785–1040 (2005)
Friedrich, J., Günther, M., Klotz, L.: A generalized Schur complement for non-negative operators on linear spaces. Banach J. Math. Anal. 12(3), 617–633 (2018)
Gebken, B., Peitz, S.: Inverse multiobjective optimization: Inferring decision criteria from data. https://arxiv.org/abs/1901.06141, January 2019
Ghate, A.: Inverse optimization in countably infinite linear programs. Oper. Res. Lett. 43(3), 231–235 (2015)
Ghate, A.: Inverse optimization in semi-infinite linear programs. Oper. Res. Lett. July 2019
Grinold, R.C.: Symmetric duality for continuous linear programs. SIAM J. Appl. Math. 18(1), 32–51 (1970)
Gudder, S.: Inner product spaces. Am. Math. Mon. 81(1), 29–36 (1974)
Heuberger, C.: Inverse combinatorial optimization: a survey on problems, methods, and results. J. Comb. Optim. 8(3), 329–361 (2004)
Ito, S., Kelley, C.T., Sachs, E.W.: Inexact primal dual interior point iteration for linear program in function spaces. Comput. Optim. Appl. 4(3), 189–201 (1995)
Iyengar, G., Kang, W.: Inverse conic programming with applications. Oper. Res. Lett. 33(3), 319–330 (2005)
Knapp, A.W.: Advanced Real Analysis. Cornerstones. Birkhauser, Boston, MA, USA (2005)
Kreyszig, E.: Introductory Functional Analysis with Applications. Wiley, New York (1978)
Lasserre, J.B.: Inverse polynomial optimization. Math. Oper. Res. 38(3), 418–436 (2013)
Luenberger, D.G.: Optimization by Vector Space Methods. Wiley, New York (1969)
Luo, X., Bertsimas, D.: A new algorithm for state-constrained separated continuous linear programs. SIAM J. Control Optim. 37(1), 177–210 (1998)
Naghavi, M., Faroughi, A.A., Zarepisheh, M.: Inverse optimization for multi-objective linear programming. Optim. Lett. 13(2), 281–294 (2019)
Neumann-Denzau, G., Behrens, J.: Inversion of seismic data using tomographical reconstruction techniques for investigations of laterally inhomogeneous media. Gephys. J. R. Astron. Soc. 79(1), 305–315 (1984)
Nolet, G.: Seismic Tomography. Reidel, Dordrecht (1987)
Nourollahi, S., Ghate, A.: Inverse optimization in minimum cost flow problems on countably infinite networks. Networks 73(3), 292–305 (2019)
Perold, A.F.: Extreme points and basic feasible solutions in continuous time linear programming. SIAM J. Control Optim. 19(1), 52–63 (1981)
Pullan, M.C.: An algorithm for a class of continuous linear programs. SIAM J. Control Optim. 31(6), 1558–1577 (1993)
Pullan, M.C.: Forms of optimal solutions for separated continuous linear programs. SIAM J. Control Optim. 33(6), 1952–1977 (1995)
Pullan, M.C.: A duality theory for separated continuous linear programs. SIAM J. Control Optim. 34(3), 931–965 (1996)
Pullan, M.C.: Linear optimal control problems with piecewise analytic solutions. J. Math. Anal. Appl. 197(1), 207–226 (1996)
Pullan, M.C.: Convergence of a general class of algorithms for separated continuous linear programs. SIAM J. Control Optim. 10(3), 722–731 (2000)
Pullan, M.C.: An extended algorithm for separated continuous linear programs. Math. Program. 93(3), 415–451 (2002)
Roland, J., Smet, Y.D., Figueira, J.R.: Inverse multi-objective combinatorial optimization. Discret. Appl. Math. 161(16–17), 2764–2771 (2013)
Rudin, W.: Principles of Mathematical Analysis, 3rd edn. McGraw-Hill, New York, NY, USA (1976)
Rudin, W.: Functional Analysis. McGraw-Hill, Singapore (1991)
Schaefer, A.J.: Inverse integer programming. Optim. Lett. 3(4), 483–489 (2009)
Shapiro, A.: On duality theory of conic linear problems. In: Goberna, M.A. Lopez, M. (eds.) Semi-infinite Programming: Recent Advances, pp. 135–165. Kluwer Academic Publishers (2001)
Tan, Y., Delong, A., Terekhov, D.: Deep inverse optimization. https://arxiv.org/abs/1812.00804, December 2018
Tarantola, A.: Inverse Problem Theory: Methods for Data Fitting and Model parameter estimation. Elsevier, Amsterdam, The Netherlands (1987)
Tavaslioglu, O., Lee, T., Valeva, S., Schaefer, A.J.: On the structure of the inverse-feasible region of a linear program. Oper. Res. Lett. 46(1), 147–152 (2018)
Troutt, M.D., Pang, W., Hou, S.: Behavioral estimation of mathematical programming objective function coefficients. Manag. Sci. 52(3), 422–434 (2006)
Vandenberghe, L., Boyd, S.: Semidefinite programming. SIAM Rev. 38(1), 49–95 (1996)
Wang, L.: Cutting plane algorithms for the inverse mixed integer linear programming problem. Oper. Res. Lett. 37(2), 114–116 (2009)
Wang, X., Zhang, S., Yao, D.D.: Separated continuous conic programming: strong duality and an approximation algorithm. SIAM J. Control Optim. 48(4), 2118–2138 (2009)
Weiss, G.: A simplex based algorithm to solve separated continuous linear programs. Math. Program. 115(1), 151–198 (2008)
Wolkowicz, H., Saigal, R., Vandenberghe, L. (eds.): Handbook of Semidefinite Programming: Theory, Algorithms, and Applications. Springer, New York (2000)
Woodhouse, J.H., Dziewonski, A.M.: Mapping the upper mantle: three dimensional modeling of earth structure by inversion of seismic waveforms. J. Geophys. Res. 89(B7), 5953–5986 (1989)
Xu, S., Zhang, J.: An inverse problem of the weighted shortest path problem. Jpn. J. Ind. Appl. Math. 12, 47–59 (1995)
Yang, C., Zhang, J., Ma, Z.: Inverse maximum flow and minimum cut problem. Optimization 40(2), 147–170 (1997)
Zhang, J., Xu, C.: Inverse optimization for linearly constrained convex separable programming problems. Eur. J. Oper. Res. 200(3), 671–679 (2010)
Acknowledgements
This research was funded in part by the National Science Foundation [grant #CMMI 1561918]. The author is grateful to an anonymous reviewer of a previous version of this paper, whose suggestions shortened and improved the presentation; helped merge two longer sections into a single Sect. 4; strengthened the proof of Lemma 2 by including measure-theoretic issues that the author had overlooked; and simplified the proof of Lemma 6 via a concrete approach instead of relying on a more general result from [32].
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Data sharing not applicable to this article as no datasets were generated or analysed during the current study.
Rights and permissions
About this article
Cite this article
Ghate, A. Inverse conic linear programs in Banach spaces. Optim Lett 15, 289–310 (2021). https://doi.org/10.1007/s11590-020-01683-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11590-020-01683-z