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

Podrobná bibliografia

Vydané v:	Annals of operations research Ročník 103; číslo 1-4; s. 193 - 211
Hlavní autori:	Wu, Soon-Yi, Fang, Shu-Cherng, Lin, Chih-Jen
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer Nature B.V 01.03.2001
Predmet:	Algorithms Approximation Linear programming Operations research Studies
ISSN:	0254-5330, 1572-9338
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!