Cost minimization models: Applications in a teaching hospital

The primary objective of this article is to explore the feasibility of the application of cost minimization analysis in a teaching hospital environment. The investigation is concerned with the development of cost per admission and cost per patient day models. These models are further used for determining the value of the length of stay that would minimize cost per patient day (projected length of stay) and for estimating the costs. This study is based on total of 109,060 observations (2002), obtained from a teaching hospital in South Florida. The top 10 diagnosis-related groups (DRGs) with the highest volume are selected for the study. The cost models are fitted to the data for an average R² value of 87.3%, and a mean absolute percentage error (MAPE) value of 16.1%. The result demonstrates that if a hospital can control the length of stay at the projected level, on average, the cost per admission and the cost per patient day will decrease. Based on 8703 admissions for the selected DRGs in 2002, the total cost per year and the cost per patient day are decreased by approximately 8.56% ($15,453,841) and 4.02% ($66.30), respectively. Overall, these results confirm that the concept of cost minimization analysis in economic theory can be applied to healthcare industries for the purpose of reducing of costs. Cost minimization and cost variation analyses offer useful information to hospital management for better decision-making. It would be an important aid in making management decisions, particularly for cost reduction.     

On the weighting of the mean-absolute-deviation cost minimization model

The mean-absolute-deviation cost minimization model, which aims to minimize sum of the mean value and the absolute deviation (AD) of the total cost multiplied by a given non-negative weighting, is one of a number of typical robust optimization models. This paper first uses a straightforward example to show that the solution obtained by this model with some weightings is not actually an optimal decision. This example also illustrates that the mean-absolute-deviation cost minimization model cannot be regarded as the conventional weighted transformation of the relevant multiobjective minimization model aiming to simultaneously minimize the mean value and AD. This paper further proves that the optimal solution obtained by the mean-absolute-deviation cost minimization model with the weighting not exceeding 0.5 will not be absolutely dominated by any other solution. This tight upper bound provides a useful guideline for practical applications.     

基于先验信息的社会碳成本贝叶斯不确定性分析

针对气候变化及经济影响存在的巨大不确定性,研究了气候变化不确定性以及先验信息对社会碳成本的影响.在贝叶斯理论框架下,采用指数分布刻画气候变化的分布特征,假设尾部变化率是一个随机变量,给出其伽玛先验分布,推导了气候变化分布的贝叶斯先验预测分布.并分别基于指数分布以及帕累托先验预测分布计算了社会碳排放成本.模拟分析发现,在未融合先验信息的情况下,由于尾部概率很小,不管是否修正消费与气候变化之间的关系,截尾社会碳成本和未截尾社会碳成本几乎重合.然而,在利用贝叶斯方法融合先验信息的情况下,社会碳成本容易受到先验信息的影响.但是,通过修正消费与气候变化之间的关系后,发现社会碳成本受先验信息的影响比较少.     

成本最小问题与(弱)DEA有效性

在文[1]的基础上,本文证明了在一定条件下对所给的决策单元、其弱DEA有效性或DEA有效性能由成本最小问题的最优解来判断.     

Mass Transportation with LQ Cost Functions

We study the optimal transport problem in the Euclidean space where the cost function is given by the value function associated with a Linear Quadratic minimization problem. Under appropriate assumptions, we generalize Brenier’s Theorem proving existence and uniqueness of an optimal transport map. In the controllable case, we show that the optimal transport map has to be the gradient of a convex function up to a linear change of coordinates. We give regularity results and also investigate the non-controllable case.     

Price Expectations and Cobwebs Under Uncertainty

Classical approaches to location problems are based on the minimization of the average distance (the median concept) or the minimization of the maximum distance (the center concept) to the service facilities. The median solution concept is primarily concerned with the spatial efficiency while the center concept is focused on the spatial equity. The k-centrum model unifies both the concepts by minimization of the sum of the k largest distances. In this paper we investigate a solution concept of the conditional median which is a generalization of the k-centrum concept taking into account the portion of demand related to the largest distances. Namely, for a specified portion (quantile) of demand we take into account the entire group of the corresponding largest distances and we minimize their average. It is shown that such an objective, similar to the standard minimax, may be modeled with a number of simple linear inequalities. Equitable properties of the solution concept are examined.     

Relaxation methods for problems with strictly convex separable costs and linear constraints

We consider the minimization problem with strictly convex, possibly nondifferentiable, separable cost and linear constraints. The dual of this problem is an unconstrained minimization problem with differentiable cost which is well suited for solution by parallel methods based on Gauss-Seidel relaxation. We show that these methods yield the optimal primal solution and, under additional assumptions, an optimal dual solution. To do this it is necessary to extend the classical Gauss-Seidel convergence results because the dual cost may not be strictly convex, and may have unbounded level sets. Work supported by the National Science Foundation under grant NSF-ECS-3217668.     

Heuristics for unequal weight delivery problems with a fixed error guarantee

This paper presents heuristics that are based on optimal partitioning of a travelling salesman tour, for solving the unequal weight delivery problem. The worst case error performance is given as a bound on the worst case ratio of the cost of the heuristic solution to the cost of the optimal solution. A fully polynomial procedure which consists of applying the optimal partitioning to a travelling salesman tour generated by Christofides' heuristic has a worst case error bound of 3.5−3/Q where Q is the capacity limit of the vehicles. When optimal partitioning is applied to an optimal travelling salesman tour, the worst case error bound becomes 3−2/Q.     

State-Feedback,Finite-Horizon,Cost Density-Shaping Control for the Linear Quadratic Gaussian Framework

A Multiple-Cumulant Cost Density-Shaping (MCCDS) control is proposed for the case when the system is linear and the cost is quadratic. This linear optimal control results from the minimization of an analytic, convex, non-negative function of cost cumulants and target cost cumulants. The MCCDS control allows the designer to shape the initial cost density with respect to a target density approximated by target cost cumulants. A numerical experiment shows that MCCDS control compares favorably with competing control paradigms in terms of official performance measures for inter-story drifts and per-story accelerations used in the first-generation structure benchmark for seismically excited buildings.     

Optimal inventory policies for an economic order quantity model with decreasing cost functions

In this paper, three total cost minimization EOQ based inventory problems are modeled and analyzed using geometric programming (GP) techniques. Through GP, optimal solutions for these models are found and sensitivity analysis is performed to investigate the effects of percentage changes in the primal objective function coefficients. The effects on the changes in the optimal order quantity and total cost when different parameters of the problems are changed is also investigated. In addition, a comparative analysis between the total cost minimization models and the basic EOQ model is conducted. By investigating the error in the optimal order quantity and total cost of these models, several interesting economic implications and managerial insights can be observed.     

考虑商品数量和商品拣选成本的AGV智能仓库订单分批问题研究

AGV(Automated Guided Vehicle,自动导引车)智能仓库是一种基于“货到人”拣选模式的自动化仓库。本文考虑了订单中商品的需求量和货架上商品的存储量,以极小化货架搬运成本和商品拣选成本为目标,建立了AGV智能仓库订单分批问题的整数规划模型。本文针对订单分批问题的特点,提出了一种基于订单和货架交替选择的贪婪求解算法。对比CPLEX求解器的精确最优解,本文提出的贪婪算法的误差百分比不超过10%,平均误差百分比为5.38%;对比基于相似性的分批算法的求解结果,本文提出的贪婪算法不仅运算时间更短,解的质量也更好。进一步地,对比不考虑商品拣选成本的订单分批模型,本文提出的模型在不明显增加货架搬运成本的前提下,可以大幅度降低商品拣选成本。因此,在订单分批模型中考虑商品拣选成本是非常必要的。     

Genetic Algorithm for Network Cost Minimization Using Threshold Based Discounting

We present a genetic algorithm for heuristically solving a cost minimization problem applied to communication networks with threshold based discounting. The network model assumes that every two nodes can communicate and offers incentives to combine of from different sources. Namely, there is a prescribed threshold on every link, and if the total of on a link is greater than the threshold, the cost of this of is discounted by a factor. A heuristic algorithm based on genetic strategy is developed and applied to a benchmark set of problems. The results are compared with former branch and bound results using the CPLEX(r)solver. For larger data instances we were able to obtain improved solutions using less CPU time, confirming the effectiveness of our heuristic approach.     

Estimating scale economies in non-convex production models

The literature on nonparametric frontier technologies lacks a method for the measurement of scale economies in non-convex settings. This paper proposes a general procedure which is based on the minimization of the ray average cost and requires the solution of a single programming problem. Our approach allows for multiple optima to introduce the case of global sub-constant scale economies, and it also permits the estimation of scale economies at a local level. The empirical application investigates the role of replicability and the relationship between global and local indicators. It also points out the managerial implications for companies operating in the Italian public transit industry.     

Numerical Methods for Single Machine Scheduling with Non-linear Cost Functions to Minimize Total Cost

In this paper we are concerned with the problem of sequencing a given set of jobs without preemption on a single machine so as to minimize total cost, where associated with each job is a processing time and a differentiable cost function defined on the completion time of the job. The problem, in general, is NP-complete and, therefore, there is unlikely to be an algorithm to solve the problem in reasonable time, thus a heuristic algorithm is desirable. We present two heuristic algorithms to solve the problem. The first algorithm is based on the differential of the cost functions, and the second algorithm is based on the least square approximation of the cost functions. Computational experiences for the case of quadratic, cubic, and exponential cost functions are presented.     

Fuzzy multi-objective vendor selection under lean procurement

This paper investigates a fuzzy multi-objective vendor selection program under lean procurement based on cost minimization, delivery schedule violation minimization, and maximizing the quality level of the purchased quantity. Specifically, the paper incorporates the vendor production capacity uncertainty into the model to identify an appropriate selection policy for vendors under practical operating conditions. The use of a soft time-window mechanism for the vendor selection model enables decision makers to further incorporate a time based performance metric for vendor evaluation, based on the degree of urgency or need for a part. A solution algorithm using fuzzy AHP is proposed. The results of a numerical example suggest that decision makers prefer vendors who can promise tighter delivery schedules rather than on cost or quality. A sensitivity analysis of the soft time-window on the achievement of the lean procurement objectives is also conducted.     

Optimal inventory policies under decreasing cost functions via geometric programming

In this paper, we establish and analyze two economic order quantity (EOQ) based inventory models under total cost minimization and profit maximization via geometric programming (GP) techniques. Through GP, optimal solutions for both models are found and managerial implications on the optimal policy are determined through bounding and sensitivity analysis. We investigate the effects on the changes in the optimal order quantity and the demand per unit time according to varied parameters by studying optimality conditions. In addition, a comparative analysis between the total cost minimization model and the profit maximization model is conducted. By investigating the error in the optimal order quantity of these two models, several interesting economic implications and managerial insights can be observed.     

可靠性网络中费用最小化问题的一种新的分枝定界算法

本文对可靠性网络中串-并系统的费用最小化问题提出一种新的分枝定界算法.我们根据这类网络的特殊结构和性质,建立了新的最优性必要条件,在分枝搜索过程中增加新的剪枝准则,从而加速了算法的收敛速度.有效的数值试验表明,该算法可求解大规模可靠性网络的费用最小化问题.     

Cost minimization and the stochastic discount factor

It is shown that a cost function subject to internal costs of adjustment induces a stochastic discount factor (pricing kernel) that is a function of random output, input and output prices, existing capital stock, and investment. The only assumption on firm preferences is that they are increasing in current period consumption and future stochastic consumption. This ensures that the firm will always act to minimize current period cost of providing future consumption, and it is the first-order conditions for this cost minimization problem that generate the stochastic discount factor, which itself can be interpreted as the marginal variable cost of varying stochastic output. A cost-based pricing kernel is estimated using annual time-series data on macroeconomic variables and returns data for the S&P 500 and commercial paper.     

Affine scaling interior Levenberg–Marquardt method for bound-constrained semismooth equations under local error bound conditions

We develop and analyze a new affine scaling Levenberg–Marquardt method with nonmonotonic interior backtracking line search technique for solving bound-constrained semismooth equations under local error bound conditions. The affine scaling Levenberg–Marquardt equation is based on a minimization of the squared Euclidean norm of linear model adding a quadratic affine scaling matrix to find a solution that belongs to the bounded constraints on variable. The global convergence results are developed in a very general setting of computing trial directions by a semismooth Levenberg–Marquardt method where a backtracking line search technique projects trial steps onto the feasible interior set. We establish that close to the solution set the affine scaling interior Levenberg–Marquardt algorithm is shown to converge locally Q-superlinearly depending on the quality of the semismooth and Levenberg–Marquardt parameter under an error bound assumption that is much weaker than the standard nonsingularity condition, that is, BD-regular condition under nonsmooth case. A nonmonotonic criterion should bring about speed up the convergence progress in the contours of objective function with large curvature.     

Heuristics for the fixed cost median problem

We describe in this paper polynomial heuristics for three important hard problems—the discrete fixed cost median problem (the plant location problem), the continuous fixed cost median problem in a Euclidean space, and the network fixed cost median problem with convex costs. The heuristics for all the three problems guarantee error ratios no worse than the logarithm of the number of customer points. The derivation of the heuristics is based on the presentation of all types of median problems discussed as a set covering problem.