Separably-infinite programs

DOI10.1007/BF01920270MaRDI QIDQ3863689zbMATH OpenFDO

Authors A. Charnes, Paul R. Gribik, K. Kortanek

Publication date 1980

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

Full work available at URL https://doi.org/10.1007/BF01920270

zbMATH Keywords

dualitylinear infinite programsnonlinear equation systemsemi-infinite programsseparably-infinite programs

Mathematics Subject Classification ID

Linear programming (90C05)

Cites work

• A duality theory for convex programs with convex constraints
• Convex Analysis
• Equivalence Theorems and Cutting Plane Algorithms for a Class of Experimental Design Problems
• scientific article; zbMATH DE number 3650305 (Why is no real title available?)
• scientific article; zbMATH DE number 3121286 (Why is no real title available?)
• scientific article; zbMATH DE number 3323651 (Why is no real title available?)
• Numerical treatment of a class of semi‐infinite programming problems
• On the theory of semi‐infinite programming and a generalization of the kuhn‐tucker saddle point theorem for arbitrary convex functions

Cited in

(2)

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

This page was built for publication: Separably-infinite programs

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