Separably-infinite programs

DOI10.1007/BF01920270zbMath0426.90055MaRDI QIDQ3863689

A. Charnes, Paul R. Gribik, Kenneth O. Kortanek

Publication date: 1980

Published in: Zeitschrift für Operations Research (Search for Journal in Brave)

zbMATH Keywords

dualitysemi-infinite programsnonlinear equation systemseparably-infinite programslinear infinite programs

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items (max. 100)

Duality in infinite dimensional linear programming ⋮ Polyextremal principles and separably-infinite programs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Equivalence Theorems and Cutting Plane Algorithms for a Class of Experimental Design Problems
• Numerical treatment of a class of semi‐infinite programming problems
• A duality theory for convex programs with convex constraints
• On the theory of semi‐infinite programming and a generalization of the kuhn‐tucker saddle point theorem for arbitrary convex functions
• Convex Analysis

This page was built for publication: Separably-infinite programs