Resumen: This paper introduces a novel method to address the pessimistic approach to the bilevel problem. It consists of considering a lexicographic biobjective optimization problem at the lower level. To emphasize the significance of this approach, we implement it in the context of the Rank Pricing Problem with Ties. This problem can be formulated as a bilevel problem that inherently demands the use of the pessimistic approach. Considering the properties of the lexicographic biobjective problem involved, we formulate this problem as a single level mixed integer optimization problem, deriving also valid values for the big-Ms involved and valid inequalities for this formulation. The computational experiment carried out confirms the relevance of the proposed method. Idioma: Inglés DOI: 10.1080/02331934.2024.2388204 Año: 2024 Publicado en: OPTIMIZATION (2024), [34 pp.] ISSN: 0233-1934 Factor impacto JCR: 1.8 (2024) Categ. JCR: MATHEMATICS, APPLIED rank: 78 / 343 = 0.227 (2024) - Q1 - T1 Categ. JCR: OPERATIONS RESEARCH & MANAGEMENT SCIENCE rank: 60 / 106 = 0.566 (2024) - Q3 - T2 Factor impacto CITESCORE: 4.3 - Applied Mathematics (Q1) - Control and Optimization (Q1) - Management Science and Operations Research (Q2)