Result: Second-order optimality conditions for nondominated solutions of multiobjective programming with C 1,1 data: Second-order optimality conditions for nondominated solutions of multiobjective programming with \(C^{1,1}\) data
Title:
Second-order optimality conditions for nondominated solutions of multiobjective programming with C 1,1 data: Second-order optimality conditions for nondominated solutions of multiobjective programming with \(C^{1,1}\) data
Authors:
Source:
Applications of Mathematics. 45:381-397
Publisher Information:
Institute of Mathematics, Czech Academy of Sciences, 2000.
Publication Year:
2000
Subject Terms:
nonsmooth constrained optimization, local Pareto optimal solutions, Nonsmooth analysis, multiobjective programming, nondominated solutions, Optimality conditions and duality in mathematical programming, 0101 mathematics, 01 natural sciences, Multi-objective and goal programming, second-order optimality conditions
Document Type:
Academic journal
Article
File Description:
application/xml
Language:
English
ISSN:
1572-9109
0862-7940
0862-7940
DOI:
10.1023/a:1022272728208
Access URL:
Rights:
Springer TDM
Accession Number:
edsair.doi.dedup.....056a62cc1116c20f06daec1a865ffa85
Database:
OpenAIRE
Further Information
The paper is devoted to new second-order necessary conditions and sufficient conditions which characterize nondominated solutions of a generalized constrained multiobjective programming problem. The paper links to the previous work by \textit{L. Liu} and \textit{M. Křížek} [Appl. Math., Praha 42, 311-320 (1997; Zbl 0903.90152)]. The vector-valued criterion function as well as constraint functions are supposed to be from the class \(C^{1,1}\). Second-order optimality conditions for local Pareto solutions are derived as a special case. The paper is well-written, definitions and theorems are precisely formulated and proofs are correct.