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

Full description

Saved in:
Bibliographic Details
Published in:Annals of operations research Vol. 103; no. 1-4; pp. 193 - 211
Main Authors: Wu, Soon-Yi, Fang, Shu-Cherng, Lin, Chih-Jen
Format: Journal Article
Language:English
Published: New York Springer Nature B.V 01.03.2001
Subjects:
Algorithms
Approximation
Linear programming
Operations research
Studies
ISSN:0254-5330, 1572-9338
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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]
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0254-5330
1572-9338
DOI:10.1023/A:1012907206299