On the structure of the weakly efficient set for quasiconvex vector minimization
DOI10.1007/S10957-019-01608-6zbMATH Open1436.90133OpenAlexW2991820123WikidataQ126530322 ScholiaQ126530322MaRDI QIDQ2302756FDOQ2302756
Authors: Frank Plastria 
Publication date: 26 February 2020
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-019-01608-6
Recommendations
- On the connectedness of the efficient set for strictly quasiconvex vector minimization problems
- scientific article; zbMATH DE number 5635366
- On the existence of weak efficient solutions of nonconvex vector optimization problems
- Optimality of Approximate Quasi-Weakly Efficient Solutions for Vector Equilibrium Problems via Convexificators
- Characterizations of nonemptiness and compactness of the set of weakly efficient solutions for convex vector optimization and applications
- scientific article; zbMATH DE number 824551
- On the set of weakly efficient minimizers for convex multiobjective programming
- Approximate quasi efficiency of set-valued optimization problems via weak subdifferential
- On minimization over weakly efficient sets
- Weak \(S\)-efficient solution of vector optimization
Multi-objective and goal programming (90C29) Convexity of real functions of several variables, generalizations (26B25) Helly-type theorems and geometric transversal theory (52A35)
Cites Work
- Convex Analysis
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Nine kinds of quasiconcavity and concavity
- Strictly quasi-convex (concave) functions and duality in mathematical programming
- Title not available (Why is that?)
- QUADRATIC ORDERED MEDIAN LOCATION PROBLEMS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
- Localization in single facility location
- Geometrical description of the weakly efficient solution set for multicriteria location problems
- Quasiconvex constrained multicriteria continuous location problems: structure of nondominated solution sets
- The Direct Power of Adjacent Vertex Programming Methods
- Seven Kinds of Convexity
- Characterizations of nonemptiness and compactness of the set of weakly efficient solutions for convex vector optimization and applications
- Inner and outer estimates for the solution sets and their asymptotic cones in vector optimization
- Characterization of the nonemptiness and compactness of solution sets in convex and nonconvex vector optimization
- Transformation of quasiconvex functions to eliminate local minima
- On the number of criteria needed to decide Pareto optimality
- Structure of Efficient Sets for Convex Objectives
- Title not available (Why is that?)
- Generalized asymptotic functions in nonconvex multiobjective optimization problems
- Involving the Helly number in Pareto reducibility
- Geometrical characterization of weakly efficient points
Cited In (7)
- Title not available (Why is that?)
- Characterizing the nonemptiness and compactness of weakly efficient solution sets for non-convex multiobjective optimization problems
- Structure of Efficient Sets for Convex Objectives
- Title not available (Why is that?)
- Notes on the value function approach to multiobjective bilevel optimization
- Characterization of nonsmooth quasiconvex functions and their Greenberg-Pierskalla's subdifferentials using semi-quasidifferentiability notion
- Weak efficiency in multiobjective quasiconvex optimization on the real-line without derivatives
This page was built for publication: On the structure of the weakly efficient set for quasiconvex vector minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2302756)
