Effects of ordering and updating techniques on the performance of the Karmarkar algorithm
Efficiency evaluation of closed-loop supply chains with proportional dual-role measures
Data Envelopment Analysis (DEA) is a beneficial mathematical programming method to measure relative efficiencies. In conventional DEA models, Decision Making Units (DMUs) are usually considered as black boxes. Also, the efficiency of DMUs is evaluated in the presence of the specified inputs and outputs. Nevertheless, in real-world applications, there are situations in which the performance of multi-stage processes like supply chains with forward and reverse flows must be measured such that some...
El método de Karmarkar: un estudio de sus variantes.
En este trabajo hacemos una revisión de varias versiones del método de Karmarkar, desarrollando las ideas fundamentales propuestas por diferentes autores en relación con los aspectos más conflictivos y de mayor interés del método original.
El primer problema dual de optimización.
Empirical regression quantile processes
We address the problem of estimating quantile-based statistical functionals, when the measured or controlled entities depend on exogenous variables which are not under our control. As a suitable tool we propose the empirical process of the average regression quantiles. It partially masks the effect of covariates and has other properties convenient for applications, e.g. for coherent risk measures of various types in the situations with covariates.
Exact and stable least squares solution to the linear programming problem
A linear programming problem is transformed to the finding an element of polyhedron with the minimal norm. According to A. Cline [6], the problem is equivalent to the least squares problem on positive ortant. An orthogonal method for solving the problem is used. This method was presented earlier by the author and it is based on the highly developed least squares technique. First of all, the method is meant for solving unstable and degenerate problems. A new version of the artifical basis method...
Experimental evaluation of a multiobjective linear programming software
Explicit polyhedral approximation of the Euclidean ball
We discuss the problem of computing points of IRn whose convex hull contains the Euclidean ball, and is contained in a small multiple of it. Given a polytope containing the Euclidean ball, we introduce its successor obtained by intersection with all tangent spaces to the Euclidean ball, whose normals point towards the vertices of the polytope. Starting from the L∞ ball, we discuss the computation of the two first successors, and give a complete analysis in the case when n=6.
Extension principle and fuzzy-mathematical programming