The infeasibility problem in traditional super efficiency models has been well established. A generalization of traditional inputor output-oriented super efficiency models, the directional distance function also suffers from infeasibility and related problems. The hyperbolic-oriented efficiency measure provides an alternative to the input-oriented, output-oriented, and directional efficiency me...

We describe simple and exact duals, and certificates of infeasibility and weak infeasibility in conic linear programming which do not rely on any constraint qualification, and retain most of the simplicity of the Lagrange dual. In particular, some of our infeasibility certificates generalize the row echelon form of a linear system of equations, and the “easy” proofs – as sufficiency of a certif...

Abstract Decision systems for solving real-world combinatorial problems must be able to report infeasibility in such a way that users can understand the reasons behind it, and determine how modify problem restore feasibility. Current methods mainly focus on reporting one or more subsets of constraints cause infeasibility. Methods also show feasibility tend less flexible and/or problem-dependent...

Super-efficiency data envelopment analysis (DEA) model is obtained when a decision making unit (DMU) under evaluation is excluded from the reference set. Because of the possible infeasibility of super-efficiency DEA model, the use of super-efficiency DEA model has been restricted to the situations where constant returns to scale (CRS) are assumed. It is shown that one of the input-oriented and ...

This paper investigates the ability of a discrete particle swarm optimization algorithm (DPSO) to evolve solutions from infeasibility to feasibility for the Vehicle Routing Problem with Time Windows (VRPTW). The proposed algorithm incorporates some principles from multi-objective optimization to allow particles to conduct a dynamic trade-off between objectives in order to reach feasibility. The...