Efficient and weakly efficient solutions for the vector topical optimization
type: Item
instance of: scholarly article
title: Efficient and weakly efficient solutions for the vector topical optimization
zbMATH Open document ID: 1410.90191
published in: Optimization Letters
publication date: 2018-12-18T00:00:00Z
Mathematics Subject Classification ID: 90C29
zbMATH DE Number: 6994906
zbMATH Keywords: vector topical function
zbMATH Keywords: infinite inequality systems
zbMATH Keywords: abstract convexity
zbMATH Keywords: Farkas type results
zbMATH Keywords: vector topical optimization
author: Chaoli Yao
author: S. J. Li
MaRDI profile type: Publication
full work available at URL: s11590-017-1193-y
OpenAlex ID: W2754731590
cites work: Farkas-Type Results With Conjugate Functions
cites work: Generalizations of Farkas’ Theorem
cites work: Farkas' lemma: three decades of generalizations for mathematical optimization
cites work: Monotonic analysis over ordered topological vector spaces. IV
cites work: Optimization of the difference of topical functions
cites work: Variable Ordering Structures in Vector Optimization
cites work: Q3340523
cites work: Q3675928
cites work: Complete Characterizations of Global Optimality for Problems Involving the Pointwise Minimum of Sublinear Functions
cites work: Farkas-Minkowski systems in semi-infinite programming
cites work: Variational methods in partially ordered spaces
cites work: Idempotency
cites work: Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex Constraints
cites work: Vector topical functions and Farkas type theorems with applications
cites work: Vector equilibrium problems with elastic demands and capacity constraints
cites work: Downward sets and their separation and approximation properties
cites work: Abstract convexity of radiant functions with applications
cites work: Abstract convexity of topical functions
cites work: Abstract convexity and global optimization
cites work: Scalarization and nonlinear scalar duality for vector optimization with preferences that are not necessarily a pre-order relation
cites work: Increasing convex-along-rays functions with applications to global optimization
cites work: Q4856875
cites work: Topical and sub-topical functions, downward sets and abstract convexity
cites work: Q3818127
cites work: Q4339231
cites work: A generalization of the Farkas lemma and applications to convex programming
DOI: 10.1007/S11590-017-1193-Y
Recommended article: Ideal, weakly efficient solutions for vector optimization problems
Recommended article: Approximation of Weak Efficient Solutions in Vector Optimization
Recommended article: Approximately Efficient Solutions in Vector Optimization
Recommended article: Weak \(S\)-efficient solution of vector optimization
Recommended article: On efficient solutions in vector optimization
Recommended article: Some properties of efficient solutions for vector optimization
Recommended article: Existence of weakly efficient solutions in vector optimization
Recommended article: Generalized properly efficient solutions of vector optimization problems
Recommended article: Vector optimization problems and approximated vector optimization problems
Recommended article: Optimality Conditions for Weakly ϵ-Efficient Solutions of Vector Optimization Problems with Applications
description: scientific article; zbMATH DE number 6994906