A variable transformation method for solving linear absolute-value objective-function problems with linear constraints (Q1095607)
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 4028778
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A variable transformation method for solving linear absolute-value objective-function problems with linear constraints |
scientific article; zbMATH DE number 4028778 |
Statements
A variable transformation method for solving linear absolute-value objective-function problems with linear constraints (English)
0 references
1988
0 references
Using the well-known simplex algorithm a variable transformation method is derived to solve the linear absolute-value objective-function problem with linear constraints. From the numerical point of view it is known that this method is not the best one.
0 references
simplex algorithm
0 references
variable transformation method
0 references
absolute-value objective-function
0 references
linear constraints
0 references
0.8997053
0 references
0.8822983
0 references
0.8763622
0 references
0.8706725
0 references
0.86129665
0 references
0.86128235
0 references
0.8608309
0 references
0.85870516
0 references
