The Theory and Application of Linear Decision Programming.
NAVY PERSONNEL RESEARCH AND DEVELOPMENT CENTER SAN DIEGO CALIF
Pagination or Media Count:
An investigation of mathematical forms that generalize the ordinary linear programming problem has led to the identification of a problem termed the decision programming canonical form. The study of this canonical form indicates the possibility of unifying certain theories and methods of decisionmaking, i.e., 1 linear programming, 2 vector maximization, 3 goal programming, 4 two person zero-sum games, 5 the Chebyshev approximation problem, and 6 satisficing. It is shown that solving a certain linear decision programming problem is equivalent to solving a linear vector minimization problem for an efficient point. Also, it is shown that a two-person, zero-sum game is equivalent to a linear decision programming problem where the payoff matrix is the set of goals. A general algorithm, called the minimum distance method, is developed for a class of decision programming problems.
- Operations Research