Files:DescriptionFile size FormatBrowse
Fulltext0.39 MBPDF (requires Acrobat Reader)Previous | Next
Authors:Xiaosong Ding: Department of Information Technology and Media, Mid-Sweden University, Sweden
Faiz Al-Khayyal: School of Industrial and Systems Engineering, Georgia Institute of Technology, USA
Publication title:Cutting Plane Methods in Decision Analysis
Conference:Nordic MPS 2004. The Ninth Meeting of the Nordic Section of the Mathematical Programming Society
Publication type: Abstract and Fulltext
Article No.:002
Abstract: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.
No. of pages:14
Series:Linköping Electronic Conference Proceedings
ISSN (print):1650-3686
ISSN (online):1650-3740
Publisher:Linköping University Electronic Press; Linköpings universitet

Xiaosong Ding, Faiz Al-Khayyal (2004). Cutting Plane Methods in Decision Analysis, Nordic MPS 2004. The Ninth Meeting of the Nordic Section of the Mathematical Programming Society;article=002 (accessed 2/14/2016)