We show in this note that, under general conditions, any convex programming problem depending continuously upon scalar parameters, and solvable for any value of the latter in a fixed compact set, admits a branch of solutions polynomial with respect to these parameters. This result may be useful to generate tractable approximations of robust convex programming problems with vanishing conservativeness.