A discretization method for systems of linear inequalities

DOI10.1007/BF00934677MaRDI QIDQ1138476zbMATH OpenFDO

Authors Klaus-Hermann Meyn

Publication date 1981

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

zbMATH Keywords

polynomialssemi-infinite programmingdiscretization methodspolyhedronssystems of linear inequalitiesapproximation of convex domains

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3676404 (Why is no real title available?)
• scientific article; zbMATH DE number 3555381 (Why is no real title available?)
• scientific article; zbMATH DE number 3611068 (Why is no real title available?)
• scientific article; zbMATH DE number 3632235 (Why is no real title available?)
• scientific article; zbMATH DE number 3441585 (Why is no real title available?)
• scientific article; zbMATH DE number 3397998 (Why is no real title available?)
• Aufgaben monotoner Art
• Maximum and monotonicity principles for elliptic boundary value problems in partitioned domains
• Numerical treatment of a class of semi‐infinite programming problems
• Real polynomials: Nonnegativity and positivity

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

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