000168076 001__ 168076
000168076 005__ 20260126155509.0
000168076 0247_ $$2doi$$a10.1080/02331934.2024.2388204
000168076 0248_ $$2sideral$$a139426
000168076 037__ $$aART-2024-139426
000168076 041__ $$aeng
000168076 100__ $$0(orcid)0000-0001-7603-9380$$aCalvete, Herminia I.$$uUniversidad de Zaragoza
000168076 245__ $$aA novel approach to pessimistic bilevel problems. An application to the rank pricing problem with ties
000168076 260__ $$c2024
000168076 5060_ $$aAccess copy available to the general public$$fUnrestricted
000168076 5203_ $$aThis 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.
000168076 536__ $$9info:eu-repo/grantAgreement/ES/DGA/E41-20R$$9info:eu-repo/grantAgreement/ES/DGA/E41-23R$$9info:eu-repo/grantAgreement/ES/MICINN/PID2019-104263RB-C43$$9info:eu-repo/grantAgreement/ES/MICINN/PID2022-139543OB-C43$$9info:eu-repo/grantAgreement/EUR/MICINN/TED2021-130961B-I00
000168076 540__ $$9info:eu-repo/semantics/openAccess$$aby-nc$$uhttps://creativecommons.org/licenses/by-nc/4.0/deed.es
000168076 590__ $$a1.8$$b2024
000168076 591__ $$aMATHEMATICS, APPLIED$$b78 / 343 = 0.227$$c2024$$dQ1$$eT1
000168076 591__ $$aOPERATIONS RESEARCH & MANAGEMENT SCIENCE$$b60 / 106 = 0.566$$c2024$$dQ3$$eT2
000168076 592__ $$a0.705$$b2024
000168076 593__ $$aApplied Mathematics$$c2024$$dQ2
000168076 593__ $$aManagement Science and Operations Research$$c2024$$dQ2
000168076 593__ $$aControl and Optimization$$c2024$$dQ2
000168076 594__ $$a4.3$$b2024
000168076 655_4 $$ainfo:eu-repo/semantics/article$$vinfo:eu-repo/semantics/acceptedVersion
000168076 700__ $$0(orcid)0000-0002-5630-3719$$aGalé, Carmen$$uUniversidad de Zaragoza
000168076 700__ $$0(orcid)0000-0003-4420-7567$$aHernández, Aitor$$uUniversidad de Zaragoza
000168076 700__ $$0(orcid)0000-0001-9993-9816$$aIranzo, José A.$$uUniversidad de Zaragoza
000168076 7102_ $$12007$$2265$$aUniversidad de Zaragoza$$bDpto. Métodos Estadísticos$$cÁrea Estadís. Investig. Opera.
000168076 773__ $$g(2024), [34 pp.]$$pOptimization$$tOPTIMIZATION$$x0233-1934
000168076 8564_ $$s229765$$uhttps://zaguan.unizar.es/record/168076/files/texto_completo.pdf$$yPostprint
000168076 8564_ $$s1457161$$uhttps://zaguan.unizar.es/record/168076/files/texto_completo.jpg?subformat=icon$$xicon$$yPostprint
000168076 909CO $$ooai:zaguan.unizar.es:168076$$particulos$$pdriver
000168076 951__ $$a2026-01-26-14:49:54
000168076 980__ $$aARTICLE