In this paper we consider the consistent partition problem in reverse convex and convex mixed-integer programming. In particular we will show that for the considered classes of convex functions, both integer and relaxed systems can be partitioned into two disjoint subsystems, each of which is...

This contribution points out a minor problem in the specifcation of technology when computing the Luenberger productivity indicator that has been hitherto ignored in the literature. The solution of this problem increases the likelihood that the directional distance functions underlying this...

The purpose of this contribution is to highlight an underexplored property of the directional distance function, a recently introduced generalization of the Shephard distance function. It diagnoses in detail the economic conditions under which infeasibilities may occur for the case of...

We present and evaluate a numerical optimization method (together with an algorithm for choosing the starting values) pertinent to the constrained optimization problem arising in the estimation of the GARCH models with inequality constraints, in particular the Simplified Component GARCH Model...