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

Mark H. Karwan; Balasubramanian Ram

doi:10.1016/0305-0548(87)90059-1

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

Mark H. Karwan
, Balasubramanian Ram

Department of Industrial and Systems Engineering

North Carolina A&T State University

Research output: Contribution to journal › Article › peer-review

2 Scopus citations

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.

Original language	English
Pages (from-to)	67-73
Number of pages	7
Journal	Computers and Operations Research
Volume	14
Issue number	1
DOIs	https://doi.org/10.1016/0305-0548(87)90059-1
State	Published - 1987

Access to Document

10.1016/0305-0548(87)90059-1

Cite this

@article{5f9411bca32945569c6e18e6c10b71be,

title = "A Lagrangean dual-based solution method for a special linear programming problem",

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.",

author = "Karwan, \{Mark H.\} and Balasubramanian Ram",

year = "1987",

doi = "10.1016/0305-0548(87)90059-1",

language = "English",

volume = "14",

pages = "67--73",

journal = "Computers and Operations Research",

issn = "0305-0548",

publisher = "Elsevier Ltd",

number = "1",

}

TY - JOUR

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

AU - Karwan, Mark H.

AU - Ram, Balasubramanian

PY - 1987

Y1 - 1987

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/0023167853

U2 - 10.1016/0305-0548(87)90059-1

DO - 10.1016/0305-0548(87)90059-1

M3 - Article

AN - SCOPUS:0023167853

SN - 0305-0548

VL - 14

SP - 67

EP - 73

JO - Computers and Operations Research

JF - Computers and Operations Research

IS - 1

ER -

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

Abstract

Access to Document

Other files and links

Fingerprint

Cite this