| Article ID: | iaor19992591 |
| Country: | Netherlands |
| Volume: | 106 |
| Issue: | 1 |
| Start Page Number: | 191 |
| End Page Number: | 197 |
| Publication Date: | Apr 1998 |
| Journal: | European Journal of Operational Research |
| Authors: | Ali Agha Iqbal, Blanco Tom, Buclatin Ben |
| Keywords: | programming: network, programming: assignment, networks |
This paper presents a specialized network procedure for the solution of pure goal network programs with preemptive priorities. The specialization solves such goal network programs efficiently since it requires a modification only in the pricing rule of the network simplex algorithm. The algorithm is used to solve multiple goal network programs that arise in the assignment of naval personnel to jobs. Computational experience indicates that the specialization dominates the sequential linear goal programming procedure.