Article | Nordic MPS 2004. The Ninth Meeting of the Nordic Section of the Mathematical Programming Society | Cutting Plane Method in Decision Analysis

Title:
Cutting Plane Method in Decision Analysis
Author:
Xiaosong Ding: Mid-Sweden University, Sweden Faiz Al-Khayyal: Mid-Sweden University, Sweden
Download:
Full text (pdf)
Year:
2004
Conference:
Nordic MPS 2004. The Ninth Meeting of the Nordic Section of the Mathematical Programming Society
Issue:
014
Article no.:
011
No. of pages:
1
Publication type:
Abstract
Published:
2004-12-28
Series:
Linköping Electronic Conference Proceedings
ISSN (print):
1650-3686
ISSN (online):
1650-3740
Publisher:
Linköping University Electronic Press; Linköpings universitet


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.

Nordic MPS 2004. The Ninth Meeting of the Nordic Section of the Mathematical Programming Society

Author:
Xiaosong Ding, Faiz Al-Khayyal
Title:
Cutting Plane Method in Decision Analysis
References:
No references available

Nordic MPS 2004. The Ninth Meeting of the Nordic Section of the Mathematical Programming Society

Author:
Xiaosong Ding, Faiz Al-Khayyal
Title:
Cutting Plane Method in Decision Analysis
Note: the following are taken directly from CrossRef
Citations:
No citations available at the moment