Characterization of solution sets of E-convex programming problems
From MaRDI portal
Characterization of solution sets of \(E\)-convex programming problems
Recommendations
- scientific article; zbMATH DE number 7108800
- \(E\)-convex sets, \(E\)-convex functions, and \(E\)-convex programming
- Optimality for \(E\text{-}[0,1]\) convex multi-objective programming problems
- scientific article; zbMATH DE number 2148569
- Characterizations of the solution sets of convex programs and variational inequality problems
Cited in
(8)- Characterization of efficient solutions of multi-objective \(E\)-convex programming problems
- An approach to characterizing \(\epsilon\)-solution sets of convex programs
- scientific article; zbMATH DE number 5665925 (Why is no real title available?)
- scientific article; zbMATH DE number 2027845 (Why is no real title available?)
- scientific article; zbMATH DE number 791044 (Why is no real title available?)
- Characterizations of solution sets of cone-constrained convex programming problems
- scientific article; zbMATH DE number 7108800 (Why is no real title available?)
- Characterizations of the solution sets of convex programs and variational inequality problems
This page was built for publication: Characterization of solution sets of \(E\)-convex programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4927868)