A generalized geometric-programming solution to “An economic production quantity model with flexibility and reliability considerations”

The classical economic production quantity (EPQ) model assumes that items are produced by a perfectly reliable production process with a fixed set-up cost. While the reliability of the production process cannot be perfected cost-free, the set-up cost can be reduced by investment in flexibility improvement. In this paper, we propose an EPQ model with a flexible and imperfect production process. We formulate this inventory decision problem using geometric programming (GP), establish more general results using the arithmetic-geometric mean inequality, and solve the problem to obtain a closed-form optimal solution. Following the theoretical treatment, we provide a numerical example to demonstrate that GP has potential as a valuable analytical tool for studying a certain class of inventory control problems. Finally we discuss some aspects of sensitivity analysis of the optimal solution based on the GP approach.     

Impacts of random noise and specification on estimates of capacity derived from data envelopment analysis

Data envelopment analysis (DEA) is widely used to estimate the efficiency of firms and has also been proposed as a tool to measure technical capacity and capacity utilization (CU). Random variation in output data can lead to downward bias in DEA estimates of efficiency and, consequently, upward bias in estimates of technical capacity. This can be particularly problematic for industries such as agriculture, aquaculture and fisheries where the production process is inherently stochastic due to environmental influences. This research uses Monte Carlo simulations to investigate possible biases in DEA estimates of technically efficient output and capacity output attributable to noisy data and investigates the impact of using a model specification that allows for variable returns to scale (VRS). We demonstrate a simple method of reducing noise induced bias when panel data is available. We find that DEA capacity estimates are highly sensitive to noise and model specification. Analogous conclusions can be drawn regarding DEA estimates of average efficiency.     

On uniform controller design for linear switched systems

Traditional method to design a controller for each subsystem of switched systems will increase the complexity of the controller’s realization. Hence this paper gives sufficient conditions for designing a uniform output feedback controller for linear switched systems, and this common controller can be used for all subsystems of the switched systems. Then the output stabilization problem for a particular class of linear switched systems under this uniform output feedback controller has been studied. An illustrative example is given in order to highlight the proposed method.     

Modified geometric programming problem and its applications

In this paper, we propose unconstrained and constrained posynomial Geometric Programming (GP) problem with negative or positive integral degree of difficulty. Conventional GP approach has been modified to solve some special typer of GP problems. In specific case, when the degree of difficulty is negative, the normality and the orthogonality conditions of the dual program give a system of linear equations. No general solution vector exists for this system of linear equations. But an approximate solution can be determined by the least square and also max-min method. Here, modified form of geometric programming method has been demonstrated and for that purpose necessary theorems have been derived. Finally, these are illustrated by numerical examples and applications.     

MOP/GP models for machine learning

Techniques for machine learning have been extensively studied in recent years as effective tools in data mining. Although there have been several approaches to machine learning, we focus on the mathematical programming (in particular, multi-objective and goal programming; MOP/GP) approaches in this paper. Among them, Support Vector Machine (SVM) is gaining much popularity recently. In pattern classification problems with two class sets, its idea is to find a maximal margin separating hyperplane which gives the greatest separation between the classes in a high dimensional feature space. This task is performed by solving a quadratic programming problem in a traditional formulation, and can be reduced to solving a linear programming in another formulation. However, the idea of maximal margin separation is not quite new: in the 1960s the multi-surface method (MSM) was suggested by Mangasarian. In the 1980s, linear classifiers using goal programming were developed extensively.This paper presents an overview on how effectively MOP/GP techniques can be applied to machine learning such as SVM, and discusses their problems.     

A prior near-ignorance Gaussian process model for nonparametric regression

This paper proposes a prior near-ignorance model for regression based on a set of Gaussian Processes (GP). GPs are natural prior distributions for Bayesian regression. They offer a great modeling flexibility and have found widespread application in many regression problems. However, a GP requires the prior elicitation of its mean function, which represents our prior belief about the shape of the regression function, and of the covariance between any two function values.In the absence of prior information, it may be difficult to fully specify these infinite dimensional parameters. In this work, by modeling the prior mean of the GP as a linear combination of a set of basis functions and assuming as prior for the combination coefficients a set of conjugate distributions obtained as limits of truncate exponential priors, we have been able to model prior ignorance about the mean of the GP. The resulting model satisfies translation invariance, learning and, under some constraints, convergence, which are desirable properties for a prior near-ignorance model. Moreover, it is shown in this paper how this model can be extended to allow for a weaker specification of the GP covariance between function values, by letting each basis function to vary in a set of functions.Application to hypothesis testing has shown how the use of this model induces the capability of automatically detecting when a reliable decision cannot be made based on the available data.     

非正态总体控制图和预防维修策略耦合优化的研究

主要探讨非正态有偏总体的过程监控和预防维修耦合优化问题。假定设备故障率随时间递增,设备发生异常前在正常状态的停留时间服从威布尔分布,一旦发生异常将导致过程均值漂移。采用赋权方差法构造X控制图,将过程监控和预防维修策略联系起来,结合生产不合格品损失、抽样成本及维修成本等,构建综合损失模型,提出动态抽样方案、控制图参数和预防维修间隔的确定方法。最后对模型进行了灵敏度分析。     

Which families of finite-dimensional joint distributions are associated with continuous-path,countably additive,stochastic processes?

Summary Necessary and sufficient conditions on a family of finite-dimensional distributions for it to be the family of finite-dimensional joint distributions of a countably additive stochastic process with continuous paths have been given by Bartoszynski in 1962. The present paper gives such conditions when the parameter space is any compact metric space and, in particular, any compact manifold. Entrata in Redazione il 23 aprile 1976. This research was prepared with the support of National Science Foundation Grant Nos. MPS 75-09459 and GP 43085.     

基于PLSR的多级制造过程关键质量特性识别方法

为解决多级制造过程关键质量特性识别中多质量特性之间的相关性问题,将偏最小二乘回归方法(Partial Least Squares Regression, PLSR)引入模型构建与分析中。首先应用状态空间方法建立多级制造过程关键质量特性识别模型,进而利用PLSR方法解决质量特性间的多重共线性问题并进行模型分析,识别关键质量特性,最后以卷烟生产过程为例介绍了该方法的应用。实例表明,该方法不仅可以有效识别多级制造过程关键质量特性,而且能够建立各级过程的输出质量对最终产品质量的影响及其质量特性之间相互关系的模型,反映多级生产过程的结构特征和各级过程质量特性之间的因果关系,为多级制造过程质量分析与控制提供依据。     

A goal programming method for obtaining interval weights from an interval comparison matrix

Crisp comparison matrices lead to crisp weight vectors being generated. Accordingly, an interval comparison matrix should give an interval weight estimate. In this paper, a goal programming (GP) method is proposed to obtain interval weights from an interval comparison matrix, which can be either consistent or inconsistent. The interval weights are assumed to be normalized and can be derived from a GP model at a time. The proposed GP method is also applicable to crisp comparison matrices. Comparisons with an interval regression analysis method are also made. Three numerical examples including a multiple criteria decision-making (MCDM) problem with a hierarchical structure are examined to show the potential applications of the proposed GP method.     

A multi-objective mathematical optimization model for process targeting using 100% inspection policy

The selection of the optimal process target is an important problem in production planning and quality control. Such process targeting problems are usually modeled in the literature using a single objective optimization model. In this paper multi-objective optimization is introduced in the process targeting area. The quality characteristic under consideration is normally distributed with unknown mean and known standard deviation, and has two market specification limits. 100% inspection is used as the mean of product quality control. Product satisfies the first specification limit is sold in a primary market at a regular price and products fails the first specification limit and satisfies the second one is sold in a secondary market at a reduced price. The product is reworked if it does not satisfy both specification limits. The developed multi-objective optimization model consists of three objective functions, which are to maximize profit, income and product uniformity using Taguchi quadratic function as a surrogate for product uniformity. An algorithm is proposed to obtain and rank the set of Pareto optimal points. The utility of the model has been demonstrated using a numerical example from the literature with some additional data the new model requires. Sensitivity analysis was conducted and showed that the results of the model are sensitive to changes in process variance. In addition the optimal objectives of the profit function and product uniformity are more sensitive to changes in model parameters than the income function.     

On goal programming formulations of the reference point method

This paper discusses connections between the multi-criteria techniques of goal programming (GP) and the reference point method (RPM). Both approaches use a certain target point in the criterion (outcome) space as a key element to model decision maker preferences. Therefore, RPM can be expressed, similarly to GP, in the modelling framework of deviational variables. The paper gives a systematic survey and analysis of the lexicographic GP models of RPM. The corresponding preference models are formalised and analysed with respect to target values interpretations as well as the Pareto efficiency of their solutions. The properties of equity among the individual achievements of solutions are also analysed with respect to the Rawlsian principle of justice.     

Goal Programming: the RPMS Network Approach

This paper presents an application of the Resource Planning and Management Systems (RPMS) network approach to the goal programming (GP) problem as an alternative to several other approaches used in the GP process. The RPMS approach to solving the GP problem is illustrated through an example. Sensitivity analysis is also discussed.     

基于C~2R模型的广义链式网络DEA模型

传统网络DEA方法是将传统DEA方法评价过程中的"黑箱"打开,考虑输入到输出的中间环节,对生产过程中的各个环节分别评价。传统网络DEA方法获得的是相对于有效决策单元评价的结果,但有时可能要相对于非有效决策单元或者非决策单元进行评价,传统网络DEA方法无法解决该类问题。为此给出相对于非有效决策单元或者非决策单元进行评价的基于C~2R模型的广义链式网络DEA模型,并探讨相关性质.     

样本数较少时的极值控制图

「１」中研究了样本数较少时中位值和极差控制图。本文研究样本数较少时极值控制图的制定方法，给出与极值有关的统计量的分布，建立极值图的控制限，极值图不需计算，有关集中和分散的信息在一个图上给出，且可画上规格限，在实践中应用方便，本文制定的极值控制可应用于小批量生产的生产过程。     

Symmetry preserving partial eigenvalue assignment for undamped structural systems

In this paper, the partial eigenvalue assignment problem for undamped structural systems by output feedback control where the output matrix is also a designing parameter is considered. We propose a method to solve this problem in which the unwanted eigenvalues are move to desired values and all other eigenpairs remain unchanged. In addition, our method can preserve symmetry of the systems. Numerical example shows that the proposed method is effective.     

Estimating the Firm Value Distribution Function by Entropy Optimization and Geometric Programming

By applying the option pricing theory ideas, this paper models the estimation of firm value distribution function as an entropy optimization problem, subject to correlation constraints. It is shown that the problem can be converted to a dual of a computationally attractive primal geometric programming (GP) problem and easily solved using publicly available software. A numerical example involving stock price data from a Japanese company demonstrates the practical value of the GP approach. Noting the use of Monte Carlo simulation in option pricing and risk analysis and its difficulties in handling distribution functions subject to correlations, the GP based method discussed here may have some computational advantages in wider areas of computational finance in addition to the application discussed here.     

Estimating parameters of proportional hazards model based on expert knowledge and statistical data

Proportional hazards model (PHM) is a convenient statistical tool that can be successfully applied in industrial problems, such as in accelerated life testing and condition-based maintenance, or in biomedical sciences. Estimation of PHM requires lifetime data, as well as condition monitoring data, which often is incomplete or missing, and necessitates the use of expert knowledge to compensate for it. This paper describes the methodology for elicitation of expert's beliefs and experience necessary to estimate the parameters of a PHM with time-dependent covariates. The paper gives a background of PHM and review of the literature related to the knowledge elicitation problem and gives a foundation for the proposed methodology. The knowledge elicitation process is based on case analyses and comparisons. This method results in a set of inequalities, which in turn define a feasible space for the parameters of the PHM. By sampling from the feasible space an empirical prior distribution of the parameters can be estimated. Then, using Bayes rule and statistical data the posterior distribution can be obtained. This technique can also provide reliable outcomes when no statistical data are available. The technique has been tested several times in laboratory experiments and in a real industrial case and has shown promising results.     

Decentralized iterative learning control for a class of large scale interconnected dynamical systems

The problem of decentralized iterative learning control for a class of large scale interconnected dynamical systems is considered. In this paper, it is assumed that the considered large scale dynamical systems are linear time-varying, and the interconnections between each subsystem are unknown. For such a class of uncertain large scale interconnected dynamical systems, a method is presented whereby a class of decentralized local iterative learning control schemes is constructed. It is also shown that under some given conditions, the constructed decentralized local iterative learning controllers can guarantee the asymptotic convergence of the local output error between the given desired local output and the actual local output of each subsystem through the iterative learning process. Finally, as a numerical example, the system coupled by two inverted pendulums is given to illustrate the application of the proposed decentralized iterative learning control schemes.