Generalized saddle point characterization of strictly efficient solutions in nearly cone-subconvexlike set-valued optimization problems
From MaRDI portal
Publication:3500514
zbMATH Open1150.90472MaRDI QIDQ3500514FDOQ3500514
Authors: Guolin Yu, Yongxin Li 
Publication date: 3 June 2008
Recommendations
- Strong efficient solutions of nearly cone-subconvexlike set-valued vector optimization problems characterized by generalized saddle point
- The saddle point and duality of set-valued optimization problem in the sense of strict efficiency
- Nearly subconvexlike set-valued maps and vector optimization problems
- Strict efficiency of set-valued optimization and scalar set-valued Lagrange mapping
- scientific article; zbMATH DE number 2165713
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)
Cited In (9)
- Title not available (Why is that?)
- Globally proper saddle point in ic-cone-convexlike set-valued optimization problems
- Strong efficient solutions of nearly cone-subconvexlike set-valued vector optimization problems characterized by generalized saddle point
- The saddle point and duality of set-valued optimization problem in the sense of strict efficiency
- Strict efficiency of set-valued optimization and scalar set-valued Lagrange mapping
- Characterizations on \(\varepsilon\)-strictly efficient elements for binary set-valued functions with saddle points
- Strong efficient solutions and Kuhn-Tucker saddle point of the set-valued optimization problems
- A saddle point characterization of efficient solutions for interval optimization problems
- Saddle point theorems of generalized subconvexlike set-valued optimality
This page was built for publication: Generalized saddle point characterization of strictly efficient solutions in nearly cone-subconvexlike set-valued optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3500514)
