A General Method of Solution for Special Structure Linear Programmes

The calculation routines of simplex, transportation, aircraft routing, generalized, capacitated and multi-index problems are shown to be special cases of a general method of linear programming. The relationship between these routines is shown and the formulation enables new methods to be created.     

An Algorithm for Solving Mixed Integer Linear Programmes

A simplified form of an algorithm for solving mixed integer linear programmes is presented. It is introduced by considering the geometry of the problem, from which most of the terminology originates. The ideas developed are then translated into algebra. A simple logical flow diagram is presented and its use illustrated by a worked example. An appendix covers the more important refinements.     

A Method for Determining Linear Solutions in Magnetohydrodynamics

Given any two-dimensional and incompressible flow describedby a set of linear partial differential equations, a methodis presented for determining the solution for the dependentvariables (velocity, pressure, etc.). The method is then usedto investigate the following magnetohydrodynamic flows. (a) The flow of an irrotational and inviscid fluid. (b) The flow of a viscous fluid. (c) The flow of an electrically conducting, inviscid fluid inthe presence of a magnetic field aligned with the flow at infinity. (d) The flow of an electrically conducting, viscous fluid inthe presence of a magnetic field having arbitrary direction.     

层次分析中排序的一种新方法

Saaty提出的特征向量排序方法（EM）已被广泛应用于层次分析（AHP）中。本文提出一种判断矩阵排序的最小扰动性（LPM）,并给出一个收敛性迭代算法和一些算例。LPM在几个重要方面优于EM。理论分析和数据结果表明：LPM是一种可行且有效的排序方法。     

群体综合评价中兼顾权威与共识的专家权重方法研究

针对多指标综合评价中专家权重确定问题,提出一种新的专家赋权思路.首先,对评价对象的每个指标都设定一组相应的专家主观权重值,以反映专家在不同指标中的重要性程度.其次,依据专家所作出的评价信息,首次提出基于专家个体与群体意见的偏差达到最小(即共识最大)的准则,通过构建最优规划模型求解客观权重.最后将专家主观权重与客观权重有效集结,得到兼顾个体权威与群体共识的综合权重.实例分析说明了该方法的可行性和有效性.     

区间型多属性群体专家权重的确定方法

针对方案偏好和属性值均为区间数的多属性群决策问题,研究了群体专家权重的确定,并提出了一种新的群决策方法．通过定义区间数向量的内积,计算专家评判的相似度和差异度,进而客观地确定了专家的权重．求解最小化主、客观偏差的目标规划模型,得到了属性的权重,利用方案的群体综合属性值给出排序结果．供应商选择的应用实例验证了方法的可行性和合理性．     

Interactive Goal Programming on the Microcomputer to Establish Priorities for Small Business

This paper presents an application of interactive goal programming on the microcomputer for small business. The illustrative application in this paper is based on real data obtained from a small business in Wisconsin, U.S.A. The microcomputer-based interactive system indicates that the goal programming approach enables the small-business manager/owner to test a variety of alternative strategies reflected by goal levels and priority structures.     

解线性目标规划的《量化优先因子法》—基于LP过程的算法

本文提出一种解线性目标规划及整数线性目标规划的《量化优先因子法》,即把目标规划中表示优先等级的优先因子 pl( l=1 ,2 ,… ,L)用能从数量级上刻划优先因子 Pl Pl+ 1的本质特征的数来表示 ,进而用 SAS/OR软件包中解线性规划的 LP过程即可求解此线性目标规划 .通过实例给出算法与用 LP过程求解的程序 .     

On Generalized Hamming Weights for Galois Ring Linear Codes

The definition of generalized Hamming weights (GHW) for linear codes over Galois rings is discussed. The properties of GHW for Galois ring linear codes are stated. Upper and existence bounds for GHW of – linear codes and a lower bound for GHW of the Kerdock code over – are derived. GHW of some – linear codes are determined.     

A Linear Goal Programming Model for Planning the Exports of Emerging Countries

A linear goal programming model for planning the exports of emerging countries is formulated in this paper. The model includes some economic factors which may affect the exports, e.g. industrial structure, labour force, value added in exports, capital efficiency, imports of raw material used for manufacturing goods designated for exports, investment plan, etc. An illustrative example is presented. A sensitivity analysis was performed in order to examine the effect of various changes made in the model on the results. It is felt that the model presented in this study would be useful to economic planners in emerging countries.     

A Linear Goal Programming Model for Trans-Shipment Problems with Flexible Supply and Demand Constraints

This paper deals with the development of a linear goal programming model for solving transshipment problems with flexible supply and demand constraints. The model was constructed based on the data obtained from a nationwide retail firm. The Wilcoxon signed-ranked test was used to show the model's flexibility and applicability. The test results were analysed and interpreted for decision making.     

An Integer Goal Programming Model for Determining Military Aircraft Expenditures

The decision-making process involved in the procurement of military weapon systems, although quite critical and complex, still encompasses the basic characteristics of a capital budgeting problem. Given a number of expenditure items and a limited budget, it is desired to procure those weapon systems that will achieve the goals and objectives of the government and/or military in the most efficient manner. Since these objectives are typically numerous and diverse, traditional decision-making techniques are not applicable. As such, integer goal programming is suggested as a technique to be employed to determine the number of military aircraft to be procured, given conflicting expenditure, budget and effectiveness goals. This method is demonstrated via a case example in which the solution results are presented.     

The Existence of Optimal Solutions for a Kind of Large-Scale Goal Proramming

In this paper, we shall decompose the large-scale goal programming model with couple-block diagnal structure into several subproblems. We will also propose the definition of deviation sets. Relations of optimal solution between sub-problems and the large-scale problem will be discussed. The existence of optimal solution for large-scale goal programming will be considered.Research is supported by a grant of the National Natural Science Foundation of China.     

Interior-Point Methods with Decomposition for Solving Large-Scale Linear Programs

This paper deals with an algorithm incorporating the interior-point method into the Dantzig–Wolfe decomposition technique for solving large-scale linear programming problems. The algorithm decomposes a linear program into a main problem and a subproblem. The subproblem is solved approximately. Hence, inexact Newton directions are used in solving the main problem. We show that the algorithm is globally linearly convergent and has polynomial-time complexity.     

多属性决策中的一种最优组合赋权方法研究

在多属性决策中权系数的确定是非常重要的。从最大地利用信息这个角度，综合各种赋权法的特点，以离差平方和为准则建立了最优组合赋权模型。并以实例表明该方法有效性。     

关于线性子空间基的一种求解方法

讨论了线性子空间基的一种求解方法.     

On Wait-and-See Stochastic Linear Programmes: An Application and an Algorithm

This paper develops a computational algorithm for estimating the mean objective function value of a stochastic linear programming problem of the passive or wait-and-see type. The algorithm is applied to a problem connected with design of a milk-grid in India and is found to be computationally effective in that case. It is most likely to be useful in the case of fairly large LP problems with a few (<10) stochastic right hand side variables.     

Asymptotic Normality for Non-linear Functionals of Non-causal Linear Processes with Summable Weights

Let be a non-causal linear process with weights a_js satisfying certain summability conditions, and the iid sequence of innovation {_i} having zero mean and finite second moment. For a large class of non-linear functional K which includes indicator functions and polynomials, the present paper develops the central limit theorem for the partial sums