An Optimum Multivariate Stratified Sampling Design with Nonresponse: A Lexicographic Goal Programming Approach

In a multivariate stratified sample survey with L strata and p > 1 characteristics, defined on each unit of the population, let the estimation of all the p-population means be of interest. As discussed by Cochran (1977), since the optimum allocation for one characteristic will not in general be optimum for other characteristics some compromise must be reached in a multiple characteristics stratified surveys. Various authors worked out allocations that are based on a compromise criterion. The resulting allocations are optimal for all characteristics in some sense, for example an allocation that minimizes the trace of the variance-covariance matrix of the estimators of the population means or an allocation that minimizes the weighted average of the variances or an allocation that maximizes the total relative efficiency of the estimators as compared to the corresponding individual optimum allocations. In the present paper the problem of optimum allocation in multivariate stratified random sampling in the presence of nonresponse has been formulated as a multiobjective integer nonlinear programming problem and a solution procedure is developed using goal programming technique. Three numerical examples are worked out to illustrate the computational details. A comparison of the proposed method with some well known methods is also carried out to show the practical utility of the proposed method.     

Estimation of more than one parameters in stratified sampling with fixed budget

In a multivariate stratified sampling more than one characteristic are defined on every unit of the population. An optimum allocation which is optimum for one characteristic will generally be far from optimum for others. A compromise criterion is needed to work out a usable allocation which is optimum, in some sense, for all the characteristics. When auxiliary information is also available the precision of the estimates of the parameters can be increased by using it. Furthermore, if the travel cost within the strata to approach the units selected in the sample is significant the cost function remains no more linear. In this paper an attempt has been made to obtain a compromise allocation based on minimization of individual coefficients of variation of the estimates of various characteristics, using auxiliary information and a nonlinear cost function with fixed budget. A new compromise criterion is suggested. The problem is formulated as a multiobjective all integer nonlinear programming problem. A solution procedure is also developed using goal programming technique.     

Optimum Allocation in Two-Stage Stratified Randomized Response Model

In the present paper a two-stage stratified Warner’s randomized response model is used to determine the optimum allocation in the presence of non-response. The problem is formulated as a Nonlinear Programming Problem. A complete method of solution of the formulated problem is proposed. Two numerical examples are worked out to illustrate the computational details of the proposed method.     

分层整群抽样的Warner模型RRT技术及其对大学生婚前性行为调查中的应用

本文的目的为敏感性问题提供科学的较复杂抽样调查方法及其统计量的计算公式。使用Cochran W.G.的抽样理论、随机应答技术的Warner模型、全概率公式、方差的基本性质等理论与方法,推导出二分类敏感问题随机应答技术Warner模型在整群抽样、分层整群抽样下总体比例的估计量及其估计方差的计算公式,并在苏州大学学生婚前性行为的调查中取得了信度较高的成功应用效果。     

On computational methods for solutions of multiobjective linear production programming games

In this paper we consider a production model in which multiple decision makers pool resources to produce finished goods. Such a production model, which is assumed to be linear, can be formulated as a multiobjective linear programming problem. It is shown that a multi-commodity game arises from the multiobjective linear production programming problem with multiple decision makers and such a game is referred to as a multiobjective linear production programming game. The characteristic sets in the game can be obtained by finding the set of all the Pareto extreme points of the multiobjective programming problem. It is proven that the core of the game is not empty, and points in the core are computed by using the duality theory of multiobjective linear programming problems. Moreover, the least core and the nucleolus of the game are examined. Finally, we consider a situation that decision makers first optimize their multiobjective linear production programming problem and then they examine allocation of profits and/or costs. Computational methods are developed and illustrative numerical examples are given.     

A compromise procedure for the multiple objective linear fractional programming problem

A generalization of a well-known multiple objective linear fractional programming (MOLFP) problem, the multiple objective fractional programming (MOFP) problem, is formulated. A concept of multiple objective programming (MOP) problem corresponding to MOFP is introduced and some relations between those problems are examined. Based on these results, a compromise procedure for MOLFP problem is proposed. A numerical example is given to show how the procedure works.     

An Optimal Chance Constraint Multivariate Stratified Sampling Design Using Auxiliary Information

When we are dealing with multivariate problem then we need an allocation which is optimal for all the characteristics in some sense because the individual optimum allocations usually differ widely unless the characteristics are highly correlated. So an allocation called “Compromise allocation” is to be worked out suggested by Cochran. When auxiliary information is also available, it is customary to use it to increase the precision of the estimates. Moreover, for practical implementation of an allocation, we need integer values of the sample sizes. In the present paper the problem is to determine the integer optimum compromise allocation when the population means of various characteristics are of interest and auxiliary information is available for the separate and combined ratio and regression estimates. This paper considers the optimum compromise allocation in multivariate stratified sampling with non-linear objective function and probabilistic non-linear cost constraint. The probabilistic non-linear cost constraint is converted into equivalent deterministic one by using Chance Constrained programming. The formulated multi-objective nonlinear programming problem is solved by Fuzzy Goal programming approach and Chebyshev approximation. Numerical illustration is also given to show the practical utility of the approaches.     

Using medians in portfolio optimization

Some new portfolio optimization models are formulated by adopting the sample median instead of the sample mean as the investment efficiency measure. The median is a robust statistic, which is less affected by outliers than the mean, and in portfolio models this is particularly relevant as data are often characterized by attributes such as skewness, fat tails and jumps, which may strongly bias the mean estimate. As in mean/variance optimization, the portfolio problems are formulated as finding the optimal weights, for example, wealth allocation, which maximize the portfolio median, with risk constrained by some risk measure, respectively, the Value-at-Risk, the Conditional Value-at-Risk, the Mean Absolute Deviation and the Maximum Loss, for a whole of four different models. All these models are formulated as mixed integer linear programming problems, which, at least for moderate sized problems, are efficiently solved by standard software. Models are tested on real financial data, compared to some benchmark portfolios, and found to give good results in terms of realized profits. An important feature is greater portfolio diversification than that obtained with other portfolio models.     

Solving a multiobjective possibilistic problem through compromise programming

Real decision problems usually consider several objectives that have parameters which are often given by the decision maker in an imprecise way. It is possible to handle these kinds of problems through multiple criteria models in terms of possibility theory.Here we propose a method for solving these kinds of models through a fuzzy compromise programming approach.To formulate a fuzzy compromise programming problem from a possibilistic multiobjective linear programming problem the fuzzy ideal solution concept is introduced. This concept is based on soft preference and indifference relationships and on canonical representation of fuzzy numbers by means of their α-cuts. The accuracy between the ideal solution and the objective values is evaluated handling the fuzzy parameters through their expected intervals and a definition of discrepancy between intervals is introduced in our analysis.     

Modeling congestion and service time in hub location problems

In this paper, we present a modeling framework for hub location problems with a service time limit considering congestion at hubs. Service time is modeled taking the traveling time on the hub network as well as the handling time and the delay caused by congestion at hubs into account. We develop mixed-integer linear programming formulations for the single and multiple allocation versions of this problem. We further extend the multiple allocation model with a possibility of direct shipments. We test our models on the well-known AP data set and analyze the effects of congestion and service time on costs and hub network design. We introduce a measure for the value of modeling congestion and show that not considering the effects of congestion may result in increased costs as well as in building infeasible hub networks.     

Pivoting for Size and Sparsity in Linear Programming Inversion Routes

^* Present address: The Operations Research Department, Stanford University, Stanford, California 94305, U.S.A. This note reports some experimental results on the inversionof real linear programming bases, with particular emphasis onthe compromise between minimum density and maximum numericalstability. The general features of a linear programming inversionroutine are outlined and the special structure of linear programsconsidered. The main result is a suitable and apparently safe"pivot tolerance" level, together with more general data onthe nature and behaviour of the problems.     

Interactive Compromise Programming

The purpose of this paper is to introduce a solution method for multiple objective linear programming (MOLP) problems. The method, called interactive compromise programming (ICP), offers a practical solution to MOLP problems by combining judgement with an automatic optimization technique in decision-making. This is realised by using the method of compromise programming and the method of a two-person zero-sum game in an iterative way. The method is illustrated by a numerical example.     

On the Relationship Between Regression Analysis and Mathematical Programming

The interaction between linear, quadratic programming and regression analysis are explored by both statistical and operations research methods. Estimation and optimization problems are formulated in two different ways: on one hand linear and quadratic programming problems are formulated and solved by statistical methods, and on the other hand the solution of the linear regression model with constraints makes use of the simplex methods of linear or quadratic programming. Examples are given to illustrate the ideas.     

Fuzzy bicriteria multi-index transportation problems for coal allocation planning of Taipower

Taipower, the official electricity authority of Taiwan, encounters several difficulties in planning annual coal purchase and allocation schedule, e.g., with multiple sources, multiple destinations, multiple coal types, different shipping vessels, and even in uncertain demand and supply. In this study, these concerns are formulated as a fuzzy bicriteria multi-index transportation problem. Furthermore, an effective and interactive algorithm is proposed which combines reducing index method and interactive fuzzy multi-objective linear programming technique to cope with a complicated problem which may be prevalent in other industries. Results obtained in this study clearly demonstrate that this model can not only satisfy more of the actual requirements of the integral system but also offer more information to the decision makers (DMs) for reference in favor of exalting decision making quality.     

Cost allocation and convex data envelopment

This paper considers allocation rules. First, we demonstrate that costs allocated by the Aumann–Shapley and the Friedman–Moulin cost allocation rules are easy to determine in practice using convex envelopment of registered cost data and parametric programming. Second, from the linear programming problems involved it becomes clear that the allocation rules, technically speaking, allocate the non-zero value of the dual variable for a convexity constraint on to the output vector. Hence, the allocation rules can also be used to allocate inefficiencies in non-parametric efficiency measurement models such as Data Envelopment Analysis (DEA). The convexity constraint of the BCC model introduces a non-zero slack in the objective function of the multiplier problem and we show that the cost allocation rules discussed in this paper can be used as candidates to allocate this slack value on to the input (or output) variables and hence enable a full allocation of the inefficiency on to the input (or output) variables as in the CCR model.     

A multi-objective optimal allocation model for irrigation water resources under multiple uncertainties

This paper proposed a multi-objective optimal water resources allocation model under multiple uncertainties. The proposed model integrated the chance-constrained programming, semi-infinite programming and integer programming into an interval linear programming. Then, the developed model is applied to irrigation water resources optimal allocation system in Minqin’s irrigation areas, Gansu Province, China. In this study, the irrigation areas’ economic benefits, social benefits and ecological benefits are regarded as the optimal objective functions. As a result, the optimal irrigation water resources allocation plans of different water types (surface water and groundwater) under different hydrological years (wet year, normal year and dry year) and probabilities are obtained. The proposed multi-objective model is unique by considering water-saving measures, irrigation water quality impact factors and the dynamic changes of groundwater exploitable quantity in the irrigation water resources optimal allocation system under uncertain environment. The obtained results are valuable for supporting the adjustment of the existing irrigation patterns and identify a desired water-allocation plan for irrigation under multiple uncertainties.     

Minimum Cost Compromise Mixed Allocation

When more than one (say p) characteristics in multivariate stratified population are defined on each unit of the population, the individual optimum allocations may differ widely and can not be used practically. Moreover, there may be a situation such that no standard allocation is advisable to all the strata, for one reason or another. In such a situation, Clark and Steel (J R Stat Soc, Ser D Stat 49(2):197–207, 2000) suggested that different allocations may be used for different groups of strata having some common characteristics for double sampling in stratification. Later on, Ahsan et al. (Aligarh J Stat 25:87–97, 2005) used the same concept in univariate stratified sampling. They minimized the variance of the stratified sample mean for a fixed cost to obtain an allocation and called this allocation “mixed allocation”. In the present paper, a “compromise mixed allocation” is worked out for the fixed precisions of the estimates of the p-population means of a multivariate stratified population. A numerical example is also presented.     

Error noted in a case study on fund allocation using goal programming

In a recent volume of European Journal of Operational Research a Case Study concerning fund allocation using goal programming was reported. However, the goal program model given was incomplete and the solution provided incorrect. In this short communication we propose a more correct formulation. The correctly formulated problem has multiple solutions. It is demonstrated that at least one solution is better than the solution reported in the original paper.     

Continuous-time linear programming problems revisited: A perturbation approach

The class of continuous-time linear programming problems under the assumption that the constraints are satisfied almost everywhere in the time interval [0,?T]?is taken into account in this article. Under this assumption, its corresponding discretized problems cannot be formulated by equally dividing the time interval [0,?T]?as subintervals of [0,?T]?. In this article, we also introduce the perturbed continuous-time linear programming problems to prove the strong duality theorem when the constraints are assumed to be satisfied a.e. in [0,?T]?.     

Editorial

Linear programming problems with fuzzy parameters are formulated by fuzzy functions. The ambiguity considered here is not randomness, but fuzziness which is associated with the lack of a sharp transition from membership to nonmembership. Parameters on constraint and objective functions are given by fuzzy numbers. In this paper, our object is the formulation of a fuzzy linear programming problem to obtain a reasonable solution under consideration of the ambiguity of parameters. This fuzzy linear programming problem with fuzzy numbers can be regarded as a model of decision problems where human estimation is influential.