The signal flow graph method of goal programming (Q1083373): Difference between revisions

This paper presents an application of the signal flow graph (SFG) method to solve the goal programming (GP) problem as an alternative to the modified simplex method in explaining the GP solution process. There are two main advantages in applying SFG to goal programming: one is technological for handling a large sparse matrix, and the other is practical for the user's convenience. The SFG method to solve the GP problem is illustrated through a simple example. Postoptimal sensitivity analysis using the SFG is also discussed.