In this paper, we investigate the approximate efficient solution and minimal sets of vector optimization problems. Firstly, we propose a new scalar function through the Gerstewitz function and discuss some of its properties. Secondly, we apply this scalar function to address the connectedness of the approximate efficient solution sets. Finally, the connectedness of the minimal sets is studied based on the above results.