A Note on the Relationship between Strongly Convex Functions and Multiobjective Stochastic Programming Problems

Vlasta Kaňková ()
Additional contact information
Vlasta Kaňková: Academy of Sciences of the Czech Republic

A chapter in Operations Research Proceedings 2004, 2005, pp 305-312 from Springer

Abstract: Abstract We consider multiobjective optimization problems in which objective functions are in the form of mathematical expectation of functions depending on a random element and a constraints set can depend on a probability measure. An efficient points set characterizes the multiobjective problems very often instead of the solution set in one objective case. A stability of the efficient points set (w.r.t. a probability measures space) and empirical estimates have been already investigated in the case when all objective functions were assumed to be strongly convex. The aim of the contribution is to present a modified assertions under rather weaker assumptions.

Date: 2005
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-540-27679-1_38

Ordering information: This item can be ordered from
http://www.springer.com/9783540276791

DOI: 10.1007/3-540-27679-3_38

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().