The signal flow graph method of goal programming (Q1083373)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3976801
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The signal flow graph method of goal programming |
scientific article; zbMATH DE number 3976801 |
Statements
The signal flow graph method of goal programming (English)
0 references
1984
0 references
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.
0 references
signal flow graph
0 references
goal programming
0 references
large sparse matrix
0 references
Postoptimal sensitivity analysis
0 references
0 references
0.774840235710144
0 references
0.7340278625488281
0 references
