An approach to approximating solutions in vector optimization is developed for vector optimization problems with arbitrary ordering cones. This paper presents a study of approximately efficient points of a given set with respect to a convex cone in an ordered Banach space. Existence results for such
An -approximation method in nonlinear vector optimization
β Scribed by Tadeusz Antczak
- Publisher
- Elsevier Science
- Year
- 2005
- Tongue
- English
- Weight
- 189 KB
- Volume
- 63
- Category
- Article
- ISSN
- 0362-546X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A means of selectrng the optrmal mesh pomts m the Hlavacek-Kutncek approxlmatlon to hnear operators IS proposed It 1s based upon the use of orthogonal collocatton, of which the Hlavacek-Kublcek
Differentiable (F , Ο)-convex function of order 2 F -approximated vector optimization problem a b s t r a c t In this paper, a new approximation method is introduced to characterize a so-called vector strict global minimizer of order 2 for a class of nonlinear differentiable multiobjective programm
## Pareto optimal solution Error term a b s t r a c t In this paper, we consider a convex vector optimization problem of finding weak Pareto optimal solutions for an extended vector-valued map from a uniformly convex and uniformly smooth Banach space to a real Banach space, with respect to the par
## Abstract Static replication of nonlinear payoffs by line segments (or equivalently vanilla options) is an important hedging method, which unfortunately is only an approximation. If the strike prices of options are adjustable (for OTC options), two optimal approximations can be defined for replic