Extremal points and optimal solutions for general capacity problems
From MaRDI portal
Publication:1190602
DOI10.1007/BF01586043zbMath0763.90098OpenAlexW2071015827MaRDI QIDQ1190602
Publication date: 26 September 1992
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01586043
subdifferentialinfinite-dimensional linear programmingcapacity programmingnormal programmingsemi-finite programming
Nonsmooth analysis (49J52) Programming in abstract spaces (90C48) Semi-infinite programming (90C34) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (7)
The Lagrange approach to infinite linear programs ⋮ From Infinite to Finite Programs: Explicit Error Bounds with Applications to Approximate Dynamic Programming ⋮ Some properties on quadratic infinite programs of integral type ⋮ Algorithms for infinite quadratic programming in \(L_p\) spaces ⋮ An inexact approach to solving linear semi-infinite programming problems ⋮ Duality theorems and algorithms for linear programming in measure spaces ⋮ Linear programming in measure spaces
Cites Work
This page was built for publication: Extremal points and optimal solutions for general capacity problems