APPLICATION OF E. HELLY'S THEOREM TO CONVEX PROGRAMMING, PROBLEMS OF BEST APPROXIMATION AND RELATED QUESTIONS

DOI10.1070/SM1969v008n02ABEH001118zbMath0195.21004OpenAlexW2140520100MaRDI QIDQ5591253

Vladimir L. Levin

Publication date: 1970

Published in: Mathematics of the USSR-Sbornik (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1070/sm1969v008n02abeh001118

zbMATH Keywords

operations research

Related Items (9)

Scenario Min-Max Optimization and the Risk of Empirical Costs ⋮ On strong duality in linear copositive programming ⋮ Immobile indices and CQ-free optimality criteria for linear copositive programming problems ⋮ Optimality conditions for convex semi-infinite programming problems with finitely representable compact index sets ⋮ An exact explicit dual for the linear copositive programming problem ⋮ Unnamed Item ⋮ Invex multifunctions and duality ⋮ On semi-infinite systems of convex polynomial inequalities and polynomial optimization problems ⋮ On minimax optimization problems

This page was built for publication: APPLICATION OF E. HELLY'S THEOREM TO CONVEX PROGRAMMING, PROBLEMS OF BEST APPROXIMATION AND RELATED QUESTIONS