A discretization method for systems of linear inequalities

DOI10.1007/BF00934677zbMath0431.90040MaRDI QIDQ1138476

Klaus-Hermann Meyn

Publication date: 1981

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

polynomialssemi-infinite programmingsystems of linear inequalitiesdiscretization methodspolyhedronsapproximation of convex domains

Mathematics Subject Classification ID

Linear programming (90C05) Inequalities and extremum problems involving convexity in convex geometry (52A40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Aufgaben monotoner Art
• Maximum and monotonicity principles for elliptic boundary value problems in partitioned domains
• Real polynomials: Nonnegativity and positivity
• Numerical treatment of a class of semi‐infinite programming problems

This page was built for publication: A discretization method for systems of linear inequalities