Solving General Capacity Problem by Relaxed Cutting Plane Approach

Soon-Yi Wu (), Shu-Cherng Fang () and Chih-Jen Lin ()

Annals of Operations Research, 2001, vol. 103, issue 1, 193-211

Abstract: 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. Copyright Kluwer Academic Publishers 2001

Keywords: capacity problem; infinite linear programming; cutting plane method; duality theory (search for similar items in EconPapers)
Date: 2001
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1012907206299 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:103:y:2001:i:1:p:193-211:10.1023/a:1012907206299

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1012907206299

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().