Cutting Plane Methods in Decision Analysis

Several computational decision analysis approaches have been developed over a number of years for solving decision problems when vague and numerically imprecise information prevails. However, the evaluation phases in the DELTA method and similar methods often give rise to special bilinear programming problems, which are time-consuming to solve in an interactive environment with general nonlinear programming solvers. This paper proposes a linear programming based global optimization algorithm that combines the cutting plane method together with the lower bound information for solving this type of problems. The central theme is to identify the global optimum as early as possible in order to save additional computational efforts. 1 Corresponding author

[1]  K. Ritter,et al.  A method for solving maximum-problems with a nonconcave quadratic objective function , 1966 .

[2]  Love Ekenberg,et al.  Non-linear Programming Solvers for Decision Analysis Support Systems , 2004 .

[3]  James E. Falk,et al.  Jointly Constrained Biconvex Programming , 1983, Math. Oper. Res..

[4]  P. Pardalos,et al.  Handbook of global optimization , 1995 .

[5]  Panos M. Pardalos,et al.  Quadratic programming with one negative eigenvalue is NP-hard , 1991, J. Glob. Optim..

[6]  Mats Danielson,et al.  Computational decision analysis , 1997 .

[7]  Mats Danielson,et al.  Generalized evaluation in decision analysis , 2005, Eur. J. Oper. Res..

[8]  Love Ekenberg,et al.  The DecideIT Decision Tool , 2003, ISIPTA.

[9]  F. Al-Khayyal.  Jointly constrained bilinear programs and related problems: an overview , 1990 .

[10]  C. M. Shetty,et al.  Rectilinear Distance Location-Allocation Problem: A Simplex Based Algorithm , 1980 .

[11]  Giorgio Gallo,et al.  Bilinear programming: An exact algorithm , 1977, Math. Program..

[12]  Ari Riabacke,et al.  Simulation and Analysis of Three Flood Management Strategies , 2003 .

[13]  Love Ekenberg,et al.  A framework for analysing decisions under risk , 1998 .

[14]  Warren P. Adams,et al.  A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems , 1998 .

[15]  Egon Balas,et al.  Intersection Cuts - A New Type of Cutting Planes for Integer Programming , 1971, Oper. Res..

[16]  Hanif D. Sherali,et al.  A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts , 1980, Math. Program..

[17]  Love Ekenberg,et al.  General risk constraints , 2001 .

[18]  Hanif D. Sherali,et al.  A new reformulation-linearization technique for bilinear programming problems , 1992, J. Glob. Optim..

[19]  C. M. Shetty,et al.  A cutting plane algorithm for the bilinear programming problem , 1977 .

[20]  Love Ekenberg,et al.  A Fast Optimization Algorithm for Bilinear Problems , 2004 .

[21]  Love Ekenberg,et al.  A Fast Bilinear Optimization Algorithm , 2004 .