Efficient and weak efficient points in vector optimization with generalized cone convexity
From MaRDI portal
Publication:1433643
Recommendations
- scientific article; zbMATH DE number 1786289
- Vector optimization w.r.t. relatively solid convex cones in real linear spaces
- scientific article; zbMATH DE number 1755834
- Characterizations of efficient and weakly efficient points in nonconvex vector optimization
- scientific article; zbMATH DE number 810379
Cites work
- scientific article; zbMATH DE number 3926624 (Why is no real title available?)
- scientific article; zbMATH DE number 3525695 (Why is no real title available?)
- scientific article; zbMATH DE number 1046022 (Why is no real title available?)
- scientific article; zbMATH DE number 1786289 (Why is no real title available?)
- scientific article; zbMATH DE number 851569 (Why is no real title available?)
- A generalization of a minimax theorem of Fan via a theorem of the alternative
- Alternative theorems and optimality conditions with weakened convexity
- Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
- Lagrange multipliers and saddle points in multiobjective programming
- Minimax Theorems
Cited in
(16)- scientific article; zbMATH DE number 1755834 (Why is no real title available?)
- Algebraic interior and separation on linear vector spaces: some comments
- Optimality conditions of set-valued optimization problem involving relative algebraic interior in ordered linear spaces
- A generalized alternative theorem of partial and generalized cone subconvexlike set-valued maps and its applications in linear spaces
- On the intrinsic core of convex cones in real linear spaces
- scientific article; zbMATH DE number 2070520 (Why is no real title available?)
- scientific article; zbMATH DE number 5635366 (Why is no real title available?)
- Proper or weak efficiency via saddle point conditions in cone-constrained nonconvex vector optimization problems
- Characterizations of efficient and weakly efficient points in nonconvex vector optimization
- Duality and saddle-points for convex-like vector optimization problems on real linear spaces
- A Characterization of Efficient and Weakly Efficient Points in Convex Vector Optimization
- scientific article; zbMATH DE number 3862956 (Why is no real title available?)
- Vector critical points and cone efficiency in nonsmooth vector optimization
- Vector optimization w.r.t. relatively solid convex cones in real linear spaces
- Some characterizations of ideal points in vector optimization problems
- Weak efficiency in vector optimization using a closure of algebraic type under cone-convexlikeness.
This page was built for publication: Efficient and weak efficient points in vector optimization with generalized cone convexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1433643)