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

https://doi.org/10.1016/0305-0548(87)90059-1Get rights and content

Abstract

This paper presents an efficient Lagrangean dual-based solution method for a linear programming problem with a set of separable constraints and one linking constraint. The authors encountered this problem in solving the generalized assignment problem via surrogate duality and constraint aggregation concepts.

References (7)

  • G.T. Ross et al.

    A branch-and-bound algorithm for the generalized assignment problem

    Math. Progr.

    (1975)
  • M.L. Fisher et al.

    A multiplier adjustment method for the generalized assignment problem

  • M.L. Fisher

    The Lagrangian relaxation method for solving integer programming problems

    Mgmt Sci.

    (1981)
There are more references available in the full text version of this article.

Cited by (0)

Mark Karwan is Professor of Industrial Engineering at the State University of New York at Buffalo. He received the B.E.S. and M.S.E. degrees from Johns Hopkins University and the Ph.D. from the Georgia Institute of Technology. Dr Karwan's research interests are in discrete optimization, multiple criteria decision making and multilevel systems. He has published articles in Operations Research, Management Science, Mathematical Programming, Naval Research Logistics Quarterly and other professional journals.

Balasubramanian Ram is an Assistant Professor in the Department of Industrial Engineering at North Carolina Agricultural and Technical State University, Greensboro. He received his B.S. (Mechanical Engineering) and M.S. degrees (Industrial Engineering) from IIT Madras and obtained his Ph.D. in Industrial Engineering from the State University of New York at Buffalo. His research interests are in mathematical programming, production planning and information systems.

View full text