Solving general capacity problem by relaxed cutting plane approach

DOI10.1023/A:1012907206299MaRDI QIDQ5959296zbMATH OpenOpenAlexWikidataFDO

Authors Soon-Yi Wu, Shu-Cherng Fang, Chih-Jen Lin

Publication date 26 March 2002

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1012907206299

zbMATH Keywords

capacity problemcutting plane methodduality theoryinfinite linear programming

Mathematics Subject Classification ID

Programming in abstract spaces (90C48) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• scientific article; zbMATH DE number 3900550
• Solving convex programs with infinitely many linear constraints by a relaxed cutting plane method
• Relaxed cutting plane method for solving linear semi-infinite programming problems
• Extremal points and optimal solutions for general capacity problems
• A numerical approach to infinite-dimensional linear programming in \(L_1\) spaces

Cited in

(7)

• Extremal points and optimal solutions for general capacity problems
• Solving convex programs with infinitely many linear constraints by a relaxed cutting plane method
• Potential theory and quadratic programming
• Algorithms for infinite quadratic programming in \(L_p\) spaces
• {\(\Gamma\)}-active constraints in convex semi-infinite programming
• scientific article; zbMATH DE number 3900550 (Why is no real title available?)
• Solution approach to infinite linear programming problem with capacity constraints

This page was built for publication: Solving general capacity problem by relaxed cutting plane approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5959296)