Abstract
In the multiobjective programming literature, the concavity of the objectives is usually assumed to be a sufficient condition in seeking Pareto-optimal solutions. This paper investigates nondominated solutions associated with dominance cones via the assumption of the quasiconcavity of the objectives. Necessary as well as sufficient conditions for such quasiconcave multiobjective programming problems are obtained.