logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

A DUAL ALGORITHM FOR THE ECONOMIC LOT-SIZING PROBLEM

delete1991-06-01
delete9
delete
OA
AI
V
VANHOESEL, S *
A
Albert Wagelmans
A
Antoon Kolen
DOI：10.1016/0377-2217(91)90166-Sdelete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
A linear description for the economic lot-sizing problem consisting of exponentially many linear inequalities was given by Barany, Van Roy and Wolsey in 1984. Usin this formulation we present a dual algorithm for the economic lot-sizing problem, which is of the same complexity as the Wagner and Whitin dynamic programming algorithm. Besides its use in sensitivity analysis the dual algorithm also provides an alternative proof of the fact that the linear description is complete.
Keywords:
INVENTORY
PLANNING
LINEAR PROGRAMMING
ECONOMIC LOT-SIZING
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

European Journal of Operational Research cover
European Journal of Operational Research
IF:
6
Papers:
2.2W
Citations:
6.4W

Organization

No organization information available