A note on Kirkwood's algebraic method for decision problems
Article Abstract:
Kirkwood's algebraic method for representing and solving large decision problems is evaluated. It is argued that the method fails to recognize coalescence while the large number of variables in a problem makes solution difficult. A modification to Kirkwood's method is proposed involving the algebraic representation of a valuation network which allows probability to be represented without preprocessing.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1996
User Contributions:
Comment about this article or add new information about this topic:
Valuation network representation and solution of asymmetric decision problems
Article Abstract:
Issues relating to asymmetric decision problems are examined in detail, with valuation networks assessed for the insights they provide in understanding this type of problem.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2000
User Contributions:
Comment about this article or add new information about this topic:
Sequential valuation networks for asymmetric decision problems
Article Abstract:
A study examines asymmetric decision problems in sequential valuation networks using algorithm.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2006
User Contributions:
Comment about this article or add new information about this topic:
- Abstracts: An approximately global optimization method for assortment problems. Dynamic programming using the Fritz-John conditions
- Abstracts: A mathematical programming viewpoint for solving the ultimate pit problem. Optimization over the efficient set of a parametric multiple objective linear programming problem
- Abstracts: A new penalty function algorithm for convex quadratic programming. Effect of maintenance on the economic design of x-control chart
- Abstracts: A forward branch-and-search algorithm and forecast horizon results for the changeover scheduling problem. Coordinated ordering decisions for short life cycle products with uncertainty in delivery time and demand