Skip to main content
  • Home
  • Development
  • Documentation
  • Donate
  • Operational login
  • Browse the archive

swh logo
SoftwareHeritage
Software
Heritage
Archive
Features
  • Search

  • Downloads

  • Save code now

  • Add forge now

  • Help

https://github.com/javierbarbero/DataEnvelopmentAnalysis.jl
23 February 2026, 20:13:11 UTC
  • Code
  • Branches (3)
  • Releases (21)
  • Visits
    • Branches
    • Releases
    • HEAD
    • refs/heads/gh-pages
    • refs/heads/master
    • refs/tags/v0.1.0
    • v0.9.2
    • v0.9.1
    • v0.9.0
    • v0.8.2
    • v0.8.1
    • v0.8.0
    • v0.7.3
    • v0.7.2
    • v0.7.1
    • v0.7.0
    • v0.6.1
    • v0.6.0
    • v0.5.2
    • v0.5.1
    • v0.5.0
    • v0.4.0
    • v0.3.1
    • v0.3.0
    • v0.2.0
    • v0.1.2
    • v0.1.1
  • 4eb9623
  • /
  • docs
  • /
  • src
  • /
  • economic
  • /
  • revenue.md
Raw File Download Save again
Take a new snapshot of a software origin

If the archived software origin currently browsed is not synchronized with its upstream version (for instance when new commits have been issued), you can explicitly request Software Heritage to take a new snapshot of it.

Use the form below to proceed. Once a request has been submitted and accepted, it will be processed as soon as possible. You can then check its processing state by visiting this dedicated page.
swh spinner

Processing "take a new snapshot" request ...

To reference or cite the objects present in the Software Heritage archive, permalinks based on SoftWare Hash IDentifiers (SWHIDs) must be used.
Select below a type of object currently browsed in order to display its associated SWHID and permalink.

  • content
  • directory
  • revision
  • snapshot
  • release
origin badgecontent badge
swh:1:cnt:e56a5577a2cddbfc08e7d673d8e74966dc06f7bd
origin badgedirectory badge
swh:1:dir:3c195039639fbebb39e17c31c60a79a72932b1d3
origin badgerevision badge
swh:1:rev:a9ad709c106fcaa6c21d03edad7c83fa02a3fbf0
origin badgesnapshot badge
swh:1:snp:372a1c00c635560cb2bb7453a7757cfc66b2f21e
origin badgerelease badge
swh:1:rel:0cd30bc91d98a3a47c40e9caa370e484e9b38b7a

This interface enables to generate software citations, provided that the root directory of browsed objects contains a citation.cff or codemeta.json file.
Select below a type of object currently browsed in order to generate citations for them.

  • content
  • directory
  • revision
  • snapshot
  • release
Generate software citation in BibTex format (requires biblatex-software package)
Generating citation ...
Generate software citation in BibTex format (requires biblatex-software package)
Generating citation ...
Generate software citation in BibTex format (requires biblatex-software package)
Generating citation ...
Generate software citation in BibTex format (requires biblatex-software package)
Generating citation ...
Generate software citation in BibTex format (requires biblatex-software package)
Generating citation ...
Tip revision: a9ad709c106fcaa6c21d03edad7c83fa02a3fbf0 authored by Javier Barbero on 14 September 2022, 17:40:23 UTC
Version 0.8.0
Tip revision: a9ad709
revenue.md
```@meta
CurrentModule = DataEnvelopmentAnalysis
```

# Revenue Models

## Revenue Efficiency Model with Radial Technical Efficiency

Let us denote by $R\left(\mathbf{x},\mathbf{p}\right)$ the maximum feasible revenue using inputs' levels $\mathbf{x}$ and given the outputs' prices $\mathbf{p}$: $R\left(\mathbf{x},\mathbf{p}\right)=\max \left\{ \sum\limits_{i=1}^{s}{{{p}_{i}}{{y}_{i}}} | {\mathbf{x}_{o}} \geqslant X\mathbf{\lambda},\;{\mathbf{y}} \leqslant Y{\mathbf{\lambda },\;{\mathbf{\lambda }} \geqslant {\mathbf{0}}} \right\}$; i.e.,  considering the output possibility set producible with $\mathbf{x}_{o}$. In this case, we calculate maximum revenue along with the optimal output quantities $\mathbf{y^{*}}$  by solving the following program:

```math
\begin{aligned}
 & \underset{\mathbf{y} ,\mathbf{\lambda }}{\mathop{\max }}\,\quad \quad \quad \;\ R\left(\mathbf{x}_{o},\mathbf{p}\right)=\mathbf{py^{*}}  \\ 
 & \text{subject}\ \text{to} \\ 
 & \quad \quad \quad \quad \quad \ {{\mathbf{x}_o}}\ge X\mathbf{\lambda } \\ 
 & \quad \quad \quad \quad \quad  \;Y\mathbf{\lambda }\ \ge {{\mathbf{y}}} \\ 
 & \quad \quad \quad \quad \quad \ \mathbf{\lambda }\ge \mathbf{0}. 
\end{aligned}
```

The measurement of revenue efficiency assuming variable returns to scale, **VRS**, adds the following condition:
```math
\sum\nolimits_{j=1}^{n}\lambda_j=1
```

*Revenue efficiency* defines as the ratio of observed revenue to maximum revenue: $RE=\mathbf{py_{o}}/R\left(\mathbf{x},\mathbf{p}\right) $. Duality results presented in *Shephard (1953)* from an output perspective allow us to decompose $RE$ into the output oriented technical efficiency measure and the residual difference corresponding to the *allocative revenue efficiency*. Allocative efficiency defines as the ratio of revenue at the technically efficient projection of the observation to maximum revenue.

In this example we compute the revnue efficiency measure under variable returns to scale:
```@example revenue
using DataEnvelopmentAnalysis

X = [5 3; 2 4; 4 2; 4 8; 7 9.0];

Y = [7 4; 10 8; 8 10; 5 4; 3 6.0];

P = [3 2; 3 2; 3 2; 3 2; 3 2.0];

dearevenue(X, Y, P)
```

### dearevenue Function Documentation

```@docs
dearevenue
```

back to top

Software Heritage — Copyright (C) 2015–2026, The Software Heritage developers. License: GNU AGPLv3+.
The source code of Software Heritage itself is available on our development forge.
The source code files archived by Software Heritage are available under their own copyright and licenses.
Terms of use: Archive access, API— Content policy— Contact— JavaScript license information— Web API