On the structure of the weakly efficient set for quasiconvex vector minimization

DOI10.1007/s10957-019-01608-6zbMath1436.90133OpenAlexW2991820123WikidataQ126530322 ScholiaQ126530322MaRDI QIDQ2302756

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

zbMATH Keywords

quasiconvex functionsweakly efficient setHelly's theoremmultiobjectivelinear enclosure

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Convexity of real functions of several variables, generalizations (26B25) Helly-type theorems and geometric transversal theory (52A35)

Related Items (1)

Characterization of nonsmooth quasiconvex functions and their Greenberg-Pierskalla's subdifferentials using semi-quasidifferentiability notion

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Inner and outer estimates for the solution sets and their asymptotic cones in vector optimization
• Localization in single facility location
• Characterization of the nonemptiness and compactness of solution sets in convex and nonconvex vector optimization
• Involving the Helly number in Pareto reducibility
• Nine kinds of quasiconcavity and concavity
• On the number of criteria needed to decide Pareto optimality
• Transformation of quasiconvex functions to eliminate local minima
• Geometrical description of the weakly efficient solution set for multicriteria location problems
• Quasiconvex constrained multicriteria continuous location problems: structure of nondominated solution sets
• Strictly quasi-convex (concave) functions and duality in mathematical programming
• Geometrical characterization of weakly efficient points
• Structure of Efficient Sets for Convex Objectives
• Generalized asymptotic functions in nonconvex multiobjective optimization problems
• QUADRATIC ORDERED MEDIAN LOCATION PROBLEMS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
• The Direct Power of Adjacent Vertex Programming Methods
• Seven Kinds of Convexity
• Convex Analysis
• Characterizations of nonemptiness and compactness of the set of weakly efficient solutions for convex vector optimization and applications

This page was built for publication: On the structure of the weakly efficient set for quasiconvex vector minimization