A Lagrangean dual-based solution method for a special linear programming problem (Q581236)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A Lagrangean dual-based solution method for a special linear programming problem |
scientific article; zbMATH DE number 4018771
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Lagrangean dual-based solution method for a special linear programming problem |
scientific article; zbMATH DE number 4018771 |
Statements
A Lagrangean dual-based solution method for a special linear programming problem (English)
0 references
1987
0 references
To solve a generalized assignment problem a Lagrangian relaxation-based dual method is used. The relaxed constraint is the single linking- equality. the authors describe a solution method which is similar to that of Karwan and Pan for the fixed charge transportation problem. Comparing the new algorithm with a regular simplex method the authors find out that the Lagrangian relaxation based dual method is twice as fast as the standard method.
0 references
generalized assignment problem
0 references
Lagrangian relaxation-based dual method
0 references
fixed charge transportation
0 references
0.9025434
0 references
0.90072477
0 references
0.8998883
0 references
0.8998809
0 references
0.89488447
0 references
0.8943385
0 references
