A Semi-Infinite Programming Model In Data Envelopment Analysis
From MaRDI portal
Publication:2747937
DOI10.1080/02331930108844538zbMath0988.90044OpenAlexW2102255100MaRDI QIDQ2747937
Oliver Stein, A. Jess, Hubertus Th. Jongen, Luka Neralić
Publication date: 22 July 2002
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331930108844538
Nonlinear programming (90C30) Management decision making, including multiple objectives (90B50) Semi-infinite programming (90C34)
Related Items
Some sufficient efficiency conditions in semiinfinite multiobjective fractional programming based on exponential type invexities ⋮ A penalty function method for the principal-agent problem with an infinite number of incentive-compatibility constraints under moral hazard ⋮ Weak Sharp Minima for Convex Infinite Optimization Problems in Normed Linear Spaces ⋮ On the stability of the Motzkin representation of closed convex sets ⋮ Saddle point criteria in semi-infinite minimax fractional programming under (Φ,ρ)-invexity ⋮ An input relaxation measure of efficiency in stochastic data envelopment analysis ⋮ Super-efficiency in stochastic data envelopment analysis: an input relaxation approach ⋮ Parametric Saddle Point Criteria in Semi-Infinite Minimax Fractional Programming Problems Under (p,r)-Invexity ⋮ A sixth bibliography of fractional programming ⋮ An interactive MOLP method for solving output-oriented DEA problems with undesirable factors
Uses Software
Cites Work
- Unnamed Item
- Some Models for Estimating Technical and Scale Inefficiencies in Data Envelopment Analysis
- Measuring the efficiency of decision making units
- Invariant multiplicative efficiency and piecewise Cobb-Douglas envelopments
- Foundations of data envelopment analysis for Pareto-Koopmans efficient empirical production functions
- Semi-Infinite Programming: Theory, Methods, and Applications
- A Simplex Method for Function Minimization
