Files:DescriptionFile size FormatBrowse
Fulltext0.01 MBPDF (requires Acrobat Reader)Previous | Next
Authors:Xiaosong Ding: Mid-Sweden University, Sweden
Faiz Al-Khayyal: Mid-Sweden University, Sweden
Publication title:Cutting Plane Method in Decision Analysis
Conference:Nordic MPS 2004. The Ninth Meeting of the Nordic Section of the Mathematical Programming Society
Publication type: Abstract
Article No.:011
Abstract:Computational decision analysis methods; such as the DELTA method; have been developed and implemented over a number of years for solving decision problems where vague and numerically imprecise information prevails. However; the evaluation phases in those methods often give rise to 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 algorithm that combines a cutting plane method with the lower bounding technique for solving this type of problem. The central theme is to identify the global optimum as early as possible in order to avoid generating unnecessary cuts in the convergent cutting plane procedure.
No. of pages:1
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 Method in Decision Analysis, Nordic MPS 2004. The Ninth Meeting of the Nordic Section of the Mathematical Programming Society;article=011 (accessed 11/26/2015)