English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Identification of the reference set for each decision making unit (DMU) is amain concern in the data envelopment analysis (DEA). All of the methodsdeveloped to date have been focused on finding the furthest reference DMUs. Inthis paper, we introduce the new notion of maximal closest reference set (MCRS)containing the maximum number of closest reference DMUs to the assessed DMU.Then, we develop a linear programming (LP) model for determining the MCRS foreach inefficient DMU. We illustrate our method through a numerical example.

A linear programming based approach for determining maximal closest reference set in DEA