Remark on the Constraint Sets in Linear Programming

DOI10.2307/2311583zbMath0109.38204OpenAlexW2317751094MaRDI QIDQ3847860

Frank Eugene Clark

Publication date: 1961

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2311583

zbMATH Keywords

applications of probability theory and statistics

Related Items

Boundedness relations in linear semi-infinite programming ⋮ Limit laws for empirical optimal solutions in random linear programs ⋮ Optimal simplex tableau characterization of unique and bounded solutions of linear programs ⋮ A survey on mixed-integer programming techniques in bilevel optimization ⋮ Clark's theorem for semi-infinite convex programs ⋮ The complementary unboundedness of dual feasible solution sets in convex programming ⋮ Theorems on the dimensions of convex sets ⋮ Boundedness relations for linear constraint sets ⋮ Norm duality for convex processes and applications ⋮ An exterior point polynomial-time algorithm for convex quadratic programming