Our aim in this article is two-fold. We use the Charnes–Cooper scalarization technique to develop KKT type conditions to completely characterize Pareto minimizers of convex vector optimization problems and further, we use that scalarization technique to develop a simple and efficient algorithm for convex vector optimization problems. Numerical examples are presented to illustrate the use of our algorithm. © 2019, Springer-Verlag GmbH Germany, part of Springer Nature.