A Linear Programming Formulation of a Special Quadratic Assignment Problem
CARNEGIE-MELLON UNIV PITTSBURGH PA MANAGEMENT SCIENCES RESEARCH GROUP
Pagination or Media Count:
A special quadratic assignment problem is shown to be equivalent to a linear programming problem with n cubed constraints and n squared variables where n is the number of elements to be assigned. A labeling algorithm similar to that for the linear transportation problem is presented for solving the problem. An example is presented that deals with triangularizing input-output matrices.
- Operations Research