Methods of finding optimal submeasures (characterization of solutions)

DOI10.1007/BF01074928zbMath0685.49028OpenAlexW2028001145MaRDI QIDQ4735704

A. D. Gajvoronskij, Yury M. Ermoliev

Publication date: 1987

Published in: Cybernetics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01074928

zbMATH Keywords

samplingreliability

Mathematics Subject Classification ID

Variational problems in a geometric measure-theoretic setting (49Q20)

Cites Work

• Optimal constrained selection of a measurable subset
• Optimum Designs in Regression Problems
• Stochastic Optimization Problems with Incomplete Information on Distribution Functions
• Monotone processes of convex and concave type
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Methods of finding optimal submeasures (characterization of solutions)