Connectedness of the efficient solution sets for a strictly path quasiconvex programming problem

DOI10.1016/0362-546X(93)90115-9zbMath0810.90113OpenAlexW2066482042MaRDI QIDQ4291623

Kunping Zhou, Wan Tao Fu

Publication date: 17 April 1995

Published in: Nonlinear Analysis: Theory, Methods & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0362-546x(93)90115-9

zbMATH Keywords

connectednesslocally convex spacestopological latticeefficient solution setpath quasiconvex mapping

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29)

Related Items (5)

On connectedness of efficient solution sets for a star cone-quasiconvex vector optimization problem ⋮ On the contractibility and connectedness of an efficient point set. ⋮ S-strictly quasi-concave vector maximisation ⋮ Connectedness of the efficient set of strictly quasiconcave sets ⋮ Contractibility of the efficient set in strictly quasiconcave vector maximization

Cites Work

• On the connectedness of the set of weakly efficient points of a vector optimization problem in locally convex spaces
• Quasiconcave vector maximization: Connectedness of the sets of Pareto- optimal and weak Pareto-optimal alternatives
• Connectedness of the set of nondominated outcomes in multicriteria optimization
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Connectedness of the efficient solution sets for a strictly path quasiconvex programming problem