A Lagrangean dual-based solution method for a special linear programming problem (Q581236): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0305-0548(87)90059-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2042851557 / rank | |||
Normal rank | |||
Revision as of 02:43, 20 March 2024
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
