In this paper, we consider the low-thrust orbit-raising problem formulated as a sequence of optimal control sub-problems. This formulation is helpful in rapid and robust generation of geocentric electric orbit-raising trajectories, however this advantage comes at the cost of sub-optimality of the computed solutions. The objective function that is minimized in each optimal control sub-problem is a convex combination of components and reflects the deviation of the maneuvering spacecraft from the geosynchronous equatorial orbit. This paper explores the impact of weights the objective function components on the optimality gap of computed orbit-raising trajectories, and numerical examples based on a variety of orbit-raising scenarios are used to illustrate this effect.