We show in this report that any system of Linear Matrix Inequalities 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 the parameters. This result is useful for studying e.g. parametric robustness or gain-scheduling issues.