A Lagrangian relaxation technique for certain inventory models

Jose A. Ventura; Cerry M. Klein

doi:10.1016/0360-8352(89)90101-0

A Lagrangian relaxation technique for certain inventory models

Jose A. Ventura, Cerry M. Klein

Marcus Department of Industrial and Manufacturing Engineering

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

Abstract

This paper examines the n-item deterministic inventory model with one linear capacity constraint. An algorithm to compute the optimal Lagrange multiplier of the capacity constraint is presented. The results of a computational analysis conducted to test the performance of the algorithm are also included.

Original language	English (US)
Pages (from-to)	436-440
Number of pages	5
Journal	Computers and Industrial Engineering
Volume	17
Issue number	1-4
DOIs	https://doi.org/10.1016/0360-8352(89)90101-0
State	Published - 1989

All Science Journal Classification (ASJC) codes

General Engineering
General Computer Science

Access to Document

10.1016/0360-8352(89)90101-0

Cite this

@article{fd4df9b3f0914850a923e765ecbfc106,

title = "A Lagrangian relaxation technique for certain inventory models",

abstract = "This paper examines the n-item deterministic inventory model with one linear capacity constraint. An algorithm to compute the optimal Lagrange multiplier of the capacity constraint is presented. The results of a computational analysis conducted to test the performance of the algorithm are also included.",

author = "Ventura, {Jose A.} and Klein, {Cerry M.}",

year = "1989",

doi = "10.1016/0360-8352(89)90101-0",

language = "English (US)",

volume = "17",

pages = "436--440",

journal = "Computers and Industrial Engineering",

issn = "0360-8352",

publisher = "Elsevier Ltd",

number = "1-4",

}

TY - JOUR

T1 - A Lagrangian relaxation technique for certain inventory models

AU - Ventura, Jose A.

AU - Klein, Cerry M.

PY - 1989

Y1 - 1989

N2 - This paper examines the n-item deterministic inventory model with one linear capacity constraint. An algorithm to compute the optimal Lagrange multiplier of the capacity constraint is presented. The results of a computational analysis conducted to test the performance of the algorithm are also included.

AB - This paper examines the n-item deterministic inventory model with one linear capacity constraint. An algorithm to compute the optimal Lagrange multiplier of the capacity constraint is presented. The results of a computational analysis conducted to test the performance of the algorithm are also included.

UR - http://www.scopus.com/inward/record.url?scp=0024913409&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0024913409&partnerID=8YFLogxK

U2 - 10.1016/0360-8352(89)90101-0

DO - 10.1016/0360-8352(89)90101-0

M3 - Article

AN - SCOPUS:0024913409

SN - 0360-8352

VL - 17

SP - 436

EP - 440

JO - Computers and Industrial Engineering

JF - Computers and Industrial Engineering

IS - 1-4

ER -

A Lagrangian relaxation technique for certain inventory models

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this