Robust Min-max Decisions with Rival Models

In the presence of rival models of the same system, an optimal policy can be computed to take account of all the models. A min-max, worst-case design, problem is an extreme case of the ordinary pooling of the models for policy optimization. It is shown that, due to its noninferiority, the min-max strategy corresponds to the robust policy. If such a robust policy happens to have too high a political cost to be implemented, an alternative pooling can be formulated using the robust pooling as a guide.

[1]  B. Rustem,et al.  Rival models in policy optimization , 1986 .

[2]  R. Becker.  The Simultaneous Use of Rival Models in Public Optimisation , 1986 .

[3]  E. Polak,et al.  A globally convergent, implementable multiplier method with automatic penalty limitation , 1980, 1980 19th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes.

[4]  Berç Rustem.  Equality and inequality constrained optimization algorithms with convergent stepsizes , 1993 .

[5]  Berç Rustem,et al.  Optimal Control for Econometric Models , 1979 .

[6]  R. L. Winkler,et al.  Averages of Forecasts: Some Empirical Results , 1983 .

[7]  S. P. Han,et al.  Variable metric methods for minimizing a class of nondifferentiable functions , 1977, Math. Program..

[8]  C. Granger,et al.  Forecasting Economic Time Series. , 1988 .

[9]  David Q. Mayne,et al.  A robust secant method for optimization problems with inequality constraints , 1981 .

[10]  G. Chow.  Effective Use of Econometric Models in Macroeconomic Policy Formulation , 1979 .

[11]  Berç Rustem,et al.  A constrained min‐max algorithm for rival models of the same economic system , 1992, Math. Program..

[12]  R. H. Edmundson,et al.  The accuracy of combining judgemental and statistical forecasts , 1986 .

[13]  Guy Cohen,et al.  An algorithm for convex constrained minimax optimization based on duality , 1981 .

[14]  B. Rustem.  A SUPERLINEARLY CONVERGENT CONSTRAINED MIN–MAX ALGORITHM FOR RIVAL MODELS OF THE SAME SYSTEM , 1989 .

[15]  Shih-Ping Han.  Superlinear Convergence of a Minimax Method , 1978 .

[16]  T. F. Coleman.  A note on ‘new algorithms for constrained minimax optimization’ , 1978, Math. Program..

[17]  A. Conn,et al.  An Efficient Method to Solve the Minimax Problem Directly , 1978 .

[18]  Mathukumalli Vidyasagar,et al.  New algorithms for constrained minimax optimization , 1977, Math. Program..

[19]  J. Medanic,et al.  Minimax solution of the multiple-target problem , 1972 .

[20]  W. Murray,et al.  A Projected Lagrangian Algorithm for Nonlinear Minimax Optimization , 1980 .

[21]  B. Rustem.  Methods for the Simultaneous Use of Multiple Models in Optimal Policy Design , 1987 .

[22]  C. Charalambous,et al.  Non-linear minimax optimization as a sequence of least pth optimization with finite values of p , 1976 .

[23]  B. Rustem.  Convergent stepsizes for constrained optimization algorithms , 1986 .

[24]  J. Medanic,et al.  On a class of differential games without saddle-point solutions , 1971 .