Countably orderable sets and their applications in optimization

DOI10.1080/02331939208843858zbMath0815.49020OpenAlexW2047837525MaRDI QIDQ4327975

Lestaw Gajek, Dariusz Zagrodny

Publication date: 14 June 1995

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939208843858

zbMATH Keywords

nonsmooth analysisoptimality conditionsmultiobjective optimizationmaximal points

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Nonsmooth analysis (49J52) Optimality conditions for problems in abstract spaces (49K27)

Related Items (11)

A generalization of the Weierstrass theorem ⋮ Vectorial form of Ekeland-type variational principle ⋮ Determining functions by slopes ⋮ Efficiencies and Pareto efficiencies of set-valued mappings on ordered spaces ⋮ Functional variational principles and coercivity over normed spaces ⋮ Brezis-Browder Principles and Applications ⋮ Maximal and Variational Principles in Vector Spaces ⋮ The convexity of the closure of the domain and the range of a maximal monotone multifunction of type NI ⋮ Comparison of existence results for efficient points ⋮ Vector variational principle ⋮ Weierstrass theorem for monotonically semicontinuous functions

This page was built for publication: Countably orderable sets and their applications in optimization