The signal flow graph method of goal programming
From MaRDI portal
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.
Recommendations
Cites work
- Converting Linear Programs to Network Problems
- Graph theory in modern engineering. Computer aided design, control, optimization, reliability analysis
- scientific article; zbMATH DE number 3508526 (Why is no real title available?)
- Optimal maintenance headcount allocation: an application of Chebyshev Goal Programming
- Synthesis of Switching Functions by Linear Graph Theory
- The signal flow graph method of goal programming
Cited in
(6)- The signal flow graph method of goal programming
- scientific article; zbMATH DE number 4016566 (Why is no real title available?)
- scientific article; zbMATH DE number 35407 (Why is no real title available?)
- Refinement for signal flow graphs
- An Improved Graph Method for Linear Goal Programming
- scientific article; zbMATH DE number 2214256 (Why is no real title available?)
This page was built for publication: The signal flow graph method of goal programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1083373)