The multislope ski-rental problem  is an extension of the classical ski-rental problem , where the player has several
options in addition to the pure
options. In this problem an
, which is the setting of the options, significantly affects the player’s performance. There is an algorithm that for a given instance, computes the best possible strategy . However, the output is given in numerical values and the relational nature between the instance and the best possible performance has not been known. In this paper we prove that even for the easiest instance, a competitive ratio smaller than
− 1) ≈ 1.58 cannot be achieved. More precisely, according to the number of options, tight bounds are obtained in a closed form. Furthermore, we establish a matching upper and lower bound of the competitive ratio each for the 3-slope and 4-slope problems.