AN η-APPROXIMATION METHOD FOR NONSMOOTH MULTIOBJECTIVE PROGRAMMING PROBLEMS

In this paper, a new approach to a characterization of solvability of a nonlinear nonsmooth multiobjective programming problem with inequality constraints is introduced. A family of η-approximated vector optimization problems is constructed by a modification of the objective and the constraint funct...

Full description

Saved in:
Bibliographic Details
Published in:The ANZIAM journal Vol. 49; no. 3; pp. 309 - 323
Main Author: ANTCZAK, TADEUSZ
Format: Journal Article
Language:English
Published: Cambridge, UK Cambridge University Press 01.01.2008
Subjects:
ISSN:1446-1811, 1446-8735
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, a new approach to a characterization of solvability of a nonlinear nonsmooth multiobjective programming problem with inequality constraints is introduced. A family of η-approximated vector optimization problems is constructed by a modification of the objective and the constraint functions in the original nonsmooth multiobjective programming problem. The connection between (weak) efficient points in the original nonsmooth multiobjective programming problem and its equivalent η-approximated vector optimization problems is established under V-invexity. It turns out that, in most cases, solvability of a nonlinear nonsmooth multiobjective programming problem can be characterized by solvability of differentiable vector optimization problems.
Bibliography:ark:/67375/6GQ-V0T4PKMK-7
ArticleID:00009
istex:EC401BCC7F7B983F4DA9CF776DDCB507EA56D0ED
PII:S1446181108000096
ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ISSN:1446-1811
1446-8735
DOI:10.1017/S1446181108000096