A Lagrangean dual-based solution method for a special linear programming problem (Q581236): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / review text | |||
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. | |||
| Property / review text: 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. / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C08 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C10 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 65K05 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C05 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 4018771 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
generalized assignment problem | |||
| Property / zbMATH Keywords: generalized assignment problem / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
Lagrangian relaxation-based dual method | |||
| Property / zbMATH Keywords: Lagrangian relaxation-based dual method / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
fixed charge transportation | |||
| Property / zbMATH Keywords: fixed charge transportation / rank | |||
Normal rank | |||
Revision as of 17:51, 1 July 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Lagrangean dual-based solution method for a special linear programming problem |
scientific article |
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
