We propose a relaxed-inertial proximal point algorithm for solving equilibrium problems involving bifunctions which satisfy in the second variable a generalized convexity notion called strong quasiconvexity, introduced by Polyak in 1966. The method is suitable for solving mixed variational inequalities and inverse mixed variational inequalities involving strongly quasiconvex functions, as these can be written as special cases of equilibrium problems. Numerical experiments where the performance of the proposed algorithm outperforms the one of the standard proximal point methods are provided, too.