Asymptotic duality over closed convex sets

DOI10.1016/0022-247X(71)90214-9zbMath0198.24603MaRDI QIDQ2539954

A. Charnes, Kenneth O. Kortanek, Adi Ben-Israel

Publication date: 1971

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

zbMATH Keywords

operations research

Related Items

OBSERVATIONS ON INFEASIBILITY DETECTORS FOR CLASSIFYING CONIC CONVEX PROGRAMS, Necessary and sufficient conditions for solving infinite-dimensional linear inequalities, Comment on a note on duality gaps in linear programming over convex sets, Infinite programming and duality in topological vector spaces, Numerical treatment of a class of semi‐infinite programming problems, A note on duality gaps in linear programming over convex sets, Modified Kuhn-Tucker conditions when a minimum is not attained, Classifying convex extremum problems over linear topologies having separation properties, Asymptotic kuhn-tucker conditions in abstract spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some characterizations of convex polyhedra
• Asymptotic cones and duality of linear relations
• Linear equations and inequalities on finite dimensional, real or complex, vector spaces: a unified theory
• On the intersections of cones and subspaces
• Seven Kinds of Convexity
• Applications of the Hahn-Banach Theorem in Approximation Theory
• Duality and asymptotic solvability over cones
• Formulation of Linear Programs in Analysis. I: Approximation Theory
• Non-Chebyshevian Moment Problems