Solving General Capacity Problem by Relaxed Cutting Plane Approach

This paper studies a class of infinite dimensional linear programming problems known as the general capacity problem. A relaxed cutting plane algorithm is proposed. A convergence proof together with some analysis of the results produced by the algorithm are given. A numerical example is also include...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Annals of operations research Ročník 103; číslo 1-4; s. 193 - 211
Hlavní autoři: Wu, Soon-Yi, Fang, Shu-Cherng, Lin, Chih-Jen
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer Nature B.V 01.03.2001
Témata:
Algorithms
Approximation
Linear programming
Operations research
Studies
ISSN:0254-5330, 1572-9338
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:This paper studies a class of infinite dimensional linear programming problems known as the general capacity problem. A relaxed cutting plane algorithm is proposed. A convergence proof together with some analysis of the results produced by the algorithm are given. A numerical example is also included to illustrate the computational procedure. [PUBLICATION ABSTRACT]
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0254-5330
1572-9338
DOI:10.1023/A:1012907206299