A Lagrangean dual-based solution method for a special linear programming problem

DOI10.1016/0305-0548(87)90059-1zbMath0626.90059OpenAlexW2042851557MaRDI QIDQ581236

Mark H. Karwan, Balasubramanian Ram

Publication date: 1987

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(87)90059-1

zbMATH Keywords

generalized assignment problemfixed charge transportationLagrangian relaxation-based dual method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Linear programming (90C05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items (1)

A simpler and faster algorithm for optimal total-work-content-power due data determination

Cites Work

• Algorithm 37. Algorithm for the solution of the 0-1 single Knapsack problem
• A Multiplier Adjustment Method for the Generalized Assignment Problem
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• A branch and bound algorithm for the generalized assignment problem
• Unnamed Item

This page was built for publication: A Lagrangean dual-based solution method for a special linear programming problem