pith. sign in

arxiv: 2605.05860 · v1 · submitted 2026-05-07 · 🧮 math.OC

A closer target setting approach to boundary problems with the Russell graph measure

Atsushi Hori , Kazuyuki Sekitani This is my paper

Pith reviewed 2026-05-08 08:26 UTC · model grok-4.3

classification 🧮 math.OC
keywords Russell graph measureboundary problemcloser target settingproduction trade-offsdata envelopment analysisefficiency measurelinear programming
0
0 comments X

The pith

Integrating closer target setting into the Russell graph measure overcomes boundary problems in DEA efficiency scoring.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper addresses the boundary problem in the Russell graph measure, where efficiency scores are not well-defined when data points touch zero values in inputs or outputs. By combining a closer target setting approach with production trade-offs, the authors create a model that always identifies efficient targets and preserves key properties of efficiency measures. This is an improvement over previous fixes that sometimes failed to find targets or lost desirable traits. The method uses a sequence of linear programs for computation and demonstrates more practical targets in a real-world example.

Core claim

The proposed Russell graph measure model with closer target setting and production trade-offs resolves the boundary problem by ensuring the efficiency measure remains well-defined across the entire nonnegative orthant. It guarantees that efficient targets are identified for all units and exhibits stronger monotonicity and other properties than existing boundary-adjusted models. Computation proceeds through successive linear programming problems.

What carries the argument

The closer target setting approach embedded in the Russell graph measure augmented by production trade-offs, which selects minimal-distance efficient points while respecting input-output substitution possibilities.

If this is right

  • Efficiency scores become defined and meaningful even for observations with zero inputs or outputs.
  • Identified targets are guaranteed to be efficient and closer to the original observation than in prior models.
  • The model can be solved using only linear programming solvers without nonlinear optimization.
  • Stronger invariance and monotonicity properties hold compared to previous boundary solutions.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • This technique could extend to other non-radial DEA measures that suffer from similar boundary definition issues.
  • Practitioners in sectors with sparse data, such as certain service industries, may obtain more actionable efficiency benchmarks.
  • Testing the model on datasets with varying numbers of zeros could reveal robustness limits.

Load-bearing premise

That the combination of closer target setting and production trade-offs will not create new inconsistencies in target identification or property violations beyond those fixed.

What would settle it

A dataset containing a unit on the boundary where the model either fails to return an efficient target or produces an undefined efficiency score.

read the original abstract

A Russell graph measure (RGM) is one of the standard DEA models, but its efficiency measure is not well-defined--or has unacceptable properties--at the boundary of the nonnegative orthant. This is known as a boundary problem. Existing studies have tackled this issue; however, their models may fail to identify an efficient target or fail to satisfy some desirable properties of efficiency measures. In this paper, we incorporate a closer target setting approach into the RGM model with production trade-offs to overcome such issues. We demonstrate that the efficiency measure of the proposed model overcomes the boundary problem and has stronger properties than existing models. We also demonstrate that the efficiency scores of the proposed model can be computed by solving a series of LPs. We conduct a numerical experiment with a real-world dataset to illustrate how targets provided by our model are realistic compared with the existing model, which also suggests the validity of our model in applications.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 3 minor

Summary. The paper proposes integrating a closer target setting approach with production trade-offs into the Russell graph measure (RGM) to address the boundary problem in DEA, where the efficiency measure is not well-defined or has poor properties at the boundary of the nonnegative orthant. The authors claim the resulting model identifies efficient targets, satisfies stronger efficiency properties than prior models, and yields scores computable via a sequence of linear programs; a numerical experiment on real-world data illustrates more realistic targets.

Significance. If the claims hold, the work strengthens DEA theory by delivering a boundary-robust RGM with improved properties and LP-based computation, addressing practical failures in target identification noted in existing models. The explicit use of linear programs for computation and the illustrative experiment are positive features that enhance applicability.

minor comments (3)
  1. The abstract asserts demonstrations of properties and LP computability but does not reference the specific sections or equations where these are established; adding such pointers would improve clarity for readers.
  2. Notation for the integrated closer target setting and production trade-offs should be introduced and defined explicitly in the model formulation section to avoid ambiguity when comparing to prior RGM variants.
  3. In the numerical experiment section, provide more detail on the real-world dataset (source, dimensions, and summary statistics) to support reproducibility and allow readers to assess the claimed realism of targets.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive assessment of our manuscript, the recognition of its contribution to strengthening DEA theory through a boundary-robust Russell graph measure, and the recommendation for minor revision. We are pleased that the use of linear programs and the numerical experiment were viewed favorably. As the report contains no specific major comments, we provide no point-by-point responses below.

Circularity Check

0 steps flagged

No significant circularity detected in derivation chain

full rationale

The paper defines a new Russell graph measure variant by explicitly incorporating a closer target setting approach and production trade-offs, then proves via theorems and a sequence of linear programs that the resulting efficiency score is well-defined at boundaries and satisfies stronger properties than prior models. These demonstrations rest on standard DEA axioms and the explicit model formulation rather than reducing to fitted parameters, self-definitional loops, or load-bearing self-citations whose validity is assumed without external verification. The numerical experiment is presented strictly as an illustration of target realism, not as statistical support for the theoretical claims. No step equates a claimed prediction or uniqueness result to its own inputs by construction.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract references standard DEA concepts and production trade-offs but does not detail any new free parameters, axioms, or invented entities; assessment limited by lack of full text.

pith-pipeline@v0.9.0 · 5455 in / 1001 out tokens · 17332 ms · 2026-05-08T08:26:42.601134+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

22 extracted references · 22 canonical work pages

  1. [1]

    Aparicio: A survey on measuring efficiency through the determination of the least distance in data envelopment analysis.Journal of Centrum Cathedra,9(2016), 143–167

    J. Aparicio: A survey on measuring efficiency through the determination of the least distance in data envelopment analysis.Journal of Centrum Cathedra,9(2016), 143–167

    work page 2016

  2. [2]

    Aparicio, J

    J. Aparicio, J. L. Ruiz, and I. Sirvent: Closest targets and minimum distance to the Pareto-efficient frontier in DEA.Journal of Productivity Analysis,28(2007), 209–218

    work page 2007

  3. [3]

    R. D. Banker, A. Charnes, and W. W. Cooper: Some models for estimating technical and scale inefficiencies in data envelopment analysis.Management Science,30(1984), 1078–1092

    work page 1984

  4. [4]

    Blackorby and R

    C. Blackorby and R. R. Russell: Aggregation of efficiency indices.Journal of Productivity Analysis, 12(1999), 5–20

    work page 1999

  5. [5]

    Briec: H¨ older distance function and measurement of technical efficiency.Journal of Productivity Analysis,11(1999), 111–131

    W. Briec: H¨ older distance function and measurement of technical efficiency.Journal of Productivity Analysis,11(1999), 111–131

    work page 1999

  6. [6]

    Charnes, W

    A. Charnes, W. W. Cooper, and E. Rhodes: Measuring the efficiency of decision making units. European Journal of Operational Research,2(1978), 429–444

    work page 1978

  7. [7]

    W. W. Cooper, K. S. Park, and J. T. Pastor: RAM: A range adjusted measure of inefficiency for use with additive models, and relations to other models and measures in DEA.Journal of Productivity Analysis,11(1999), 5–42

    work page 1999

  8. [8]

    Emrouznejad, L

    A. Emrouznejad, L. Brzezicki, and C. Lu: Development and evolution of slacks-based measure models in data envelopment analysis: a comprehensive review of the literature.Journal of Economic Surveys, 39(2025), 2106–2133

    work page 2025

  9. [9]

    F¨ are, S

    R. F¨ are, S. Grosskopf, and C. K. Lovell:The measurement of efficiency of production, Volume 6 (Springer Science & Business Media, 1985)

    work page 1985

  10. [10]

    F¨ are and C

    R. F¨ are and C. K. Lovell: Measuring the technical efficiency of production.Journal of Economic Theory,19(1978), 150–162

    work page 1978

  11. [11]

    Fukuyama, H

    H. Fukuyama, H. Masaki, K. Sekitani, and J. Shi: Distance optimization approach to ratio-form efficiency measures in data envelopment analysis.Journal of Productivity Analysis,42(2014), 175– 186. 17

    work page 2014

  12. [12]

    T. C. Koopmans: An analysis of production as an efficient combination of activities. In T. C. Koopmans (ed.):Activity Analysis of Production and Allocation(Wiley, 1951)

    work page 1951

  13. [13]

    S. B. Levkoff, R. R. Russell, and W. Schworm: Boundary problems with the “Russell” graph measure of technical efficiency: a refinement.Journal of Productivity Analysis,37(2012), 239–248

    work page 2012

  14. [14]

    J. T. Pastor, J. L. Ruiz, and I. Sirvent: An enhanced DEA Russell graph efficiency measure.European Journal of Operational Research,115(1999), 596–607

    work page 1999

  15. [15]

    V. V. Podinovski: Production trade-offs and weight restrictions in data envelopment analysis.Jour- nal of the Operational Research Society,55(2004), 1311–1322

    work page 2004

  16. [16]

    M. C. A. S. Portela, P. C. Borges, and E. Thanassoulis: Finding closest targets in non-oriented DEA models: the case of convex and non-convex technologies.Journal of Productivity Analysis,19 (2003), 251–269

    work page 2003

  17. [17]

    Razipour-GhalehJough, F

    S. Razipour-GhalehJough, F. Hosseinzadeh Lotfi, G. Jahanshahloo, M. Rostamy-Malkhalifeh, and H. Sharafi: Finding closest target for bank branches in the presence of weight restrictions using data envelopment analysis.Annals of Operations Research,288(2020), 755–787

    work page 2020

  18. [18]

    R. R. Russell: On the axiomatic approach to the measurement of technical efficiency. In W. Eichhorn (ed.):Measurement in Economics(Physica-Verlag HD, Heidelberg, 1988), 207–217

    work page 1988

  19. [19]

    R. R. Russell and W. Schworm: Properties of inefficiency indexes on⟨input, output⟩space.Journal of Productivity Analysis,36(2011), 143–156

    work page 2011

  20. [20]

    Sekitani and Y

    K. Sekitani and Y. Zhao: Closest targets in Russell graph measure of strongly monotonic efficiency for an extended facet production possibility set.Journal of the Operational Research Society,76 (2025), 2150–2168

    work page 2025

  21. [21]

    Sueyoshi and K

    T. Sueyoshi and K. Sekitani: An occurrence of multiple projections in DEA-based measurement of technical efficiency: Theoretical comparison among DEA models from desirable properties.European Journal of Operational Research,196(2009), 764–794

    work page 2009

  22. [22]

    Tone: A slacks-based measure of efficiency in data envelopment analysis.European Journal of Operational Research,130(2001), 498–509

    K. Tone: A slacks-based measure of efficiency in data envelopment analysis.European Journal of Operational Research,130(2001), 498–509. 18

    work page 2001