In this article, we present a conjugate duality for nonconvex optimization problems. This duality scheme is symmetric and has zero gap. As applied to a vector-maximization problem, it transforms the latter into an optimization problem over a weakly efficient set which can be solved by monotonic optimization methods.