A Semi-Infinite Programming Model In Data Envelopment Analysis

DOI10.1080/02331930108844538MaRDI QIDQ2747937zbMATH OpenOpenAlexFDO

Authors A. Jess, Hubertus T. Jongen, Luka Neralić, Oliver Stein

Publication date 22 July 2002

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331930108844538

zbMATH Keywords

bi-level algorithmdata envelopment analysisdecision-making

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Nonlinear programming (90C30) Semi-infinite programming (90C34)

Recommendations

• A generalized model for data envelopment analysis
• Data envelopment analysis and its related linear programming models
• Estimation of efficiency and infinitesimals in data envelopment analysis
• An integer-valued data envelopment analysis model with bounded outputs
• A generalized model for data envelopment analysis with interval data
• Recent models in data envelopment analysis: Theory and applications
• An inverse optimization model for imprecise data envelopment analysis
• scientific article; zbMATH DE number 2222641
• Data Envelopment Analysis on a Relaxed Set of Assumptions

Cites work

• A Simplex Method for Function Minimization
• Foundations of data envelopment analysis for Pareto-Koopmans efficient empirical production functions
• scientific article; zbMATH DE number 1776908 (Why is no real title available?)
• Invariant multiplicative efficiency and piecewise Cobb-Douglas envelopments
• Measuring the efficiency of decision making units
• Semi-Infinite Programming: Theory, Methods, and Applications
• Some Models for Estimating Technical and Scale Inefficiencies in Data Envelopment Analysis

Cited in

(11)

• A penalty function method for the principal-agent problem with an infinite number of incentive-compatibility constraints under moral hazard
• An interactive MOLP method for solving output-oriented DEA problems with undesirable factors
• On the stability of the Motzkin representation of closed convex sets
• Some sufficient efficiency conditions in semiinfinite multiobjective fractional programming based on exponential type invexities
• A sixth bibliography of fractional programming
• Weak Sharp Minima for Convex Infinite Optimization Problems in Normed Linear Spaces
• Saddle point criteria in semi-infinite minimax fractional programming under \((\Phi,\rho)\)-invexity
• Parametric Saddle Point Criteria in Semi-Infinite Minimax Fractional Programming Problems Under (p,r)-Invexity
• Super-efficiency in stochastic data envelopment analysis: an input relaxation approach
• Stochastic data envelopment analysis in the presence of undesirable outputs: an application to the power industry
• An input relaxation measure of efficiency in stochastic data envelopment analysis

Describes a project that uses

Uses Software

• DEA

This page was built for publication: A Semi-Infinite Programming Model In Data Envelopment Analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2747937)