Padé-type approximants are rational functions that approximate a given formal power series. Boutry [Numer. Algorithms, 33 (2003), pp 113-122] constructed Padé-type approximants that correspond to the averaged Gauss quadrature rules introduced by Laurie [Math. Comp., 65 (1996), pp. 739-747]. More recently, Spalević [Math. Comp., 76 (2007), pp. 1483-1492 proposed optimal averaged Gauss quadrature rules, that have higher degree of precision than the corresponding averaged Gauss rules, with the same number of nodes. This paper defines Padé-type approximants associated with optimal averaged Gauss rules. Numerical examples illustrate their performance.