No label defined (Q3763907)
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 4020859
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 4020859 |
Statements
1985
0 references
multiple criteria decision making
0 references
linear goal programming
0 references
revised goal simplex method
0 references
sparsity technique
0 references
0.7909049987792969
0 references
0.7806670665740967
0 references
0.7787469029426575
0 references
0.7694433331489563
0 references
Recently, multiple criteria decision making has been well established as a practical approach to seek a satisfactory solution to a decision making problem. Goal programming is one of the most powerful MCDM tools satisfying operational assumptions that reflect the actual decision making process in real-world situations. In this paper we propose an efficient method implemented on a microcomputer for solving linear goal programming problems. It is an iterative revised goal simplex method using the sparsity technique. We design an interactive software package for microcomputers based on this method. From some computational experience, we can state that the revised iterative goal simplex and method using the sparsity technique is the most efficient one for microcomputers for solving goal programming problems.
0 references