{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T09:05:29Z","timestamp":1779267929370,"version":"3.51.4"},"reference-count":24,"publisher":"EDP Sciences","issue":"3","license":[{"start":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T00:00:00Z","timestamp":1779235200000},"content-version":"vor","delay-in-days":19,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"accepted":{"date-parts":[[2026,1,23]]},"published-print":{"date-parts":[[2026,5]]},"abstract":"<jats:p>The Russell Measure Model (RM), a nonlinear data envelopment analysis (DEA) model for evaluating decision-making units, allows for independent and disproportionate inputs and outputs, which makes it superior and more accurate than the radial models. The model is formulated as a second-order cone programming (SOCP) problem, and its dual is derived using SOCP duality. Previous studies have noted the complexity and limited interpretability of this dual formulation and have proposed an alternative using semidefinite programming (SDP) problem. This paper demonstrates the equivalence of these dual formulations through variable transformations. In addition, a new SOCP formulation of the dual RM model is introduced, which is in the usual form of multiplier models without any variable transformations. It is shown that this new formulation is equivalent to the SDP model. Moreover, using the conic model, a new approach is proposed to identify the unique maximal reference set and projection by solving one model, thereby improving upon the existing two-stage approach. Two examples demonstrate the advantages of the proposed models.<\/jats:p>","DOI":"10.1051\/ro\/2026009","type":"journal-article","created":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T08:49:44Z","timestamp":1769503784000},"page":"1307-1323","source":"Crossref","is-referenced-by-count":0,"title":["On the dual formulation of Russell measure model"],"prefix":"10.1051","volume":"60","author":[{"given":"Keyvan","family":"Asanimoghadam","sequence":"first","affiliation":[{"name":"Department of Applied Mathematics, Faculty of Mathematical Sciences, University of Guilan","place":["Iran"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maziar","family":"Salahi","sequence":"additional","affiliation":[{"name":"Department of Applied Mathematics, Faculty of Mathematical Sciences, University of Guilan","place":["Iran"]}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2026,5,20]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10107-002-0339-5","volume":"95","author":"Alizadeh","year":"2003","journal-title":"Math. Program."},{"key":"R2","doi-asserted-by":"crossref","first-page":"1078","DOI":"10.1287\/mnsc.30.9.1078","volume":"30","author":"Banker","year":"1984","journal-title":"Manage. Sci."},{"key":"R3","unstructured":"Bazaraa M.S., Jarvis J.J. and Sherali H.D., Linear Programming and Network Flows. John Wiley & Sons (2011)."},{"key":"R4","doi-asserted-by":"crossref","unstructured":"Ben-Tal A. and Nemirovski A., Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications. Society for Industrial and Applied Mathematics, Chapter 2 (2001).","DOI":"10.1137\/1.9780898718829"},{"key":"R5","doi-asserted-by":"crossref","unstructured":"Boyd S.P. and Vandenberghe L., Convex Optimization. Cambridge University Press (2004).","DOI":"10.1017\/CBO9780511804441"},{"key":"R6","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1016\/0377-2217(78)90138-8","volume":"2","author":"Charnes","year":"1978","journal-title":"Eur. J. Oper. Res."},{"key":"R7","doi-asserted-by":"crossref","first-page":"102022","DOI":"10.1016\/j.omega.2018.12.011","volume":"91","author":"Chen","year":"2020","journal-title":"Omega"},{"key":"R8","doi-asserted-by":"crossref","unstructured":"Cooper W.W., Seiford L.M. and Tone K., Introduction to Data Envelopment Analysis and its Uses: With DEA-solver Software and References. Springer Science & Business Media (2006).","DOI":"10.1007\/0-387-29122-9"},{"key":"R9","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1016\/0022-0531(78)90060-1","volume":"19","author":"F\u00e4re","year":"1978","journal-title":"J. Econ. Theory"},{"key":"R10","unstructured":"Grant M. and Boyd S., CVX: Matlab Software for Disciplined Convex Programming, version 2.1 (2014)."},{"key":"R11","unstructured":"Grant M., Boyd S. and Ye Y., CVX: Matlab Software for Disciplined Convex Programming, version 2.0 beta (2013, September)."},{"key":"R12","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1057\/palgrave.jors.2600386","volume":"48","author":"Green","year":"1997","journal-title":"J. Oper. Res. Soc."},{"key":"R13","doi-asserted-by":"crossref","first-page":"386","DOI":"10.1016\/j.ejor.2018.01.012","volume":"268","author":"Hali\u010dk\u00e1","year":"2018","journal-title":"Eur. J. Oper. Res."},{"key":"R14","doi-asserted-by":"crossref","first-page":"664","DOI":"10.1016\/j.ejor.2013.06.046","volume":"232","author":"Krivonozhko","year":"2014","journal-title":"Eur. J. Oper. Res."},{"key":"R15","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/S0024-3795(98)10032-0","volume":"284","author":"Lobo","year":"1998","journal-title":"Linear Algebra Appl."},{"key":"R16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.cam.2009.11.045","volume":"234","author":"Lotfi","year":"2010","journal-title":"J. Comput. Appl. Math."},{"key":"R17","doi-asserted-by":"crossref","first-page":"779","DOI":"10.1016\/j.ejor.2015.03.029","volume":"245","author":"Mehdiloozad","year":"2015","journal-title":"Eur. J. Oper. Res."},{"key":"R18","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1016\/S0377-2217(98)00098-8","volume":"115","author":"Pastor","year":"1999","journal-title":"Eur. J. Oper. Res."},{"key":"R19","unstructured":"Sekitani K., A two-stage approach for Russell measure in DEA (Mathematical Programming in the 21st Century: Optimization Modeling and Algorithms). 1629 (2009) 152\u2013163."},{"key":"R20","doi-asserted-by":"crossref","first-page":"764","DOI":"10.1016\/j.ejor.2008.01.045","volume":"196","author":"Sueyoshi","year":"2009","journal-title":"Eur. J. Oper. Res."},{"key":"R21","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1016\/j.ejor.2006.02.042","volume":"180","author":"Sueyoshi","year":"2007","journal-title":"Eur. J. Oper. Res."},{"key":"R22","doi-asserted-by":"crossref","first-page":"1918","DOI":"10.1016\/j.ejor.2005.10.043","volume":"176","author":"Sueyoshi","year":"2007","journal-title":"Eur. J. Oper. Res."},{"key":"R23","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1016\/S0377-2217(99)00407-5","volume":"130","author":"Tone","year":"2001","journal-title":"Eur. J. Oper. Res."},{"key":"R24","doi-asserted-by":"crossref","first-page":"1705","DOI":"10.1007\/s10479-024-06384-9","volume":"351","author":"Trnovsk\u00e1","year":"2025","journal-title":"Ann. Oper. Res."}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2026009\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T08:06:37Z","timestamp":1779264397000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2026009"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5]]},"references-count":24,"journal-issue":{"issue":"3"},"alternative-id":["ro240778"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2026009","relation":{},"ISSN":["0399-0559","2804-7303"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"2804-7303","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5]]}}}