Skip Navigation
The signal flow graph (SFG) is a way of expressing linear algebraic equations. Thus, SFG has been effectively applied to solve sparse linear systems. In this paper the authors apply SFG to solve the goal programming problem. The SFG approach to goal programming has many promising advantages-ease of manipulating sparse matrices, conceptually simple ways to explain sensitivity analysis, and the graphical illustration of the solution process.
Your browser does not appear to support JavaScript, or you have turned JavaScript off. You may use unl.edu without enabling JavaScript, but certain functions may not be available.