Computation of efficient solutions of discretely distributed stochastic optimization problems

DOI10.1007/BF01415892zbMath0771.90074OpenAlexW1974873843MaRDI QIDQ4009795

Kurt Marti

Publication date: 27 September 1992

Published in: [https://portal.mardi4nfdi.de/entity/Q3031760 ZOR Zeitschrift f�r Operations Research Methods and Models of Operations Research] (Search for Journal in Brave)

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

zbMATH Keywords

efficient solutionsdiscrete distributionsutility functionscompromise solutions

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Stochastic programming (90C15) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Cites Work

• Theory of multiobjective optimization
• Descent directions and efficient solutions in discretely distributed stochastic programs
• Methods of statistical linearization (survey)
• On L1 and Chebyshev estimation
• On a Theorem of Hardy, Littlewood, Polya, and Blackwell
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computation of efficient solutions of discretely distributed stochastic optimization problems