Remark on the Constraint Sets in Linear Programming

DOI10.2307/2311583MaRDI QIDQ3847860zbMATH OpenOpenAlexFDO

Authors 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

Cited in

(10)

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

This page was built for publication: Remark on the Constraint Sets in Linear Programming

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