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.     

面向远海岛屿的救助基地选址优化模型及其算法

为解决在远海海域选择岛屿建设救助基地的方案优化问题,建立了基于GIS和智能算法的双目标优化模型,采用自适应拉伸的拥挤距离计算公式,设计了自适应精英保留策略对算法进行改进,通过剖析决策者选择最优方案的基本原则,得到了性价比最高的优化方案。最后,以我国南海南沙群岛选择岛屿建设救助基地的方案优化为例进行分析,得到了较好结果。为验证文中改进算法的有效性,选取多个不同规模的方案进行分析比较,结果显示本文提出的算法在优化结果及解的分布性等方面均更优。本文研究为我国海上岛屿救助基地选址和在资源有限的情况下如何科学配置救助船队提供了分析方法。     

Goal Programming and Extensions

Journal of the Operational Research Society -     

Goal Programming and Agricultural Planning

Goal Programming is similar in structure to linear programming, but offers a more flexible approach to planning problems by allowing a number of goals which are not necessarily compatible to be taken into account, simultaneously. The use of linear programming in farm planning is reviewed briefly. Consideration is given to published evidence of the goals of farmers, and ways in which these goals can be represented. A goal programming model of a 600 acre mixed farm is described and evaluated. Advantages and shortcomings of goal programming in relation to linear programming are considered. It is found that goal programming can be used as a means of generating a range of possible solutions to the planning problem.     

A Heuristic Algorithm for Assigning Crews Among Bases in an Airlift Operation

In this paper, the optimum assignment of crews among the bases in an airlift operation is considered. An airlift operation consists of transporting large quantities of equipment and personnel among various bases. The crews operating the aircraft rest for a constant period of time after arriving at the bases, before flying again. In order to minimize the waiting times of the aircraft at the bases for want of rested crews, the available crews are distributed initially among the bases.Using earlier results of the mean waiting time of an aircraft at a single base and the probability distribution of the inter-departure times of the aircraft from the base, the problem of optimum allocation of crews is formulated as a non-linear integer programming problem. A heuristic algorithm is developed using the Lagrange multiplier. Its solution is compared with the exact solution for a number of test cases, and the algorithm is found to perform well.     

An Exact Method for Fractional Goal Programming

Goal Programming with fractional objectives can be reduced to mathematical programming with a linear objective under linear and quadratic constraints, thus optimal solutions can be obtained by using existing Global Optimization techniques. However, only heuristic procedures are suggested in the literature on the field. In this note we explore the practical applicability of a recent algorithm for nonconvex quadratic programming with quadratic constraints for this problem. Encouraging computational experiences for randomly generated instances with up to 14 fractional objectives are presented.     

可拓目标规划方法及其应用

本文基于可拓数学和物元分析理论，介绍了可拓集合、关联函数和可拓满意点等概念，提出了可拓优化的概念，建立了可拓目标规划模型，给出了可拓目标规划方法的算法．实例表明，可拓目标规划方法有一定的实用性．     

Goal Programming and Allocating Children to Secondary Schools in Reading

The secondary allocation scheme proposed for Reading by Berkshire County Council (B.C.C.) in 1978 has been investigated under the Race Relations Act. After reviewing previous programming studies of devising school catchment areas, this paper uses the technique of goal programming to analyze the problem of proposing catchment areas for the secondary schools in Greater Reading. Six goals are identified: distance, difficulty of journey, racial balance, reading-age retarded balance, sex balance and capacity utilization. The problem is solved for 10 alternative sets of goal weights, and it is shown that most of these dominate the B.C.C. solution.     

A Goal Programming Method for Generating Priority Vectors

The generation of priority vectors from pairwise comparison information is an integral part of the Analytic Hierarchy Process (AHP). Traditionally, either the right eigenvector method or the logarithmic least squares method have been used. In this paper, a goal programming method (GPM) is presented that has, as its objective, the generation of the priority vector whose associated comparison values are, on average, the closest to the pairwise comparison information provided by the evaluator. The GPM possesses the properties of correctness in the consistent case, comparison order invariance, smoothness, and power invariance. Unlike other methods, it also possesses the additional property that the presence of a single outlier cannot prevent the identification of the correct priority vector. The GPM also has a pair of naturally meaningful consistency indicators that offer the opportunity for empowering the decision maker. The GPM is thus an attractive alternative to other proposed methods.     

A Chance-Constrained Goal Programming Model for Capital Budgeting

A chance-constrained formulation is presented for a zero-one goal programming problem whose coefficients in the technological matrix are stochastic. The model is presented with a numerical example. A capital budgeting problem is taken for illustration.     

A Markovian Goal Programming Approach to Aggregate Manpower Planning

The combination of a manpower supply model (a Markov type model based on historical probabilities of losses, promotions and gains) and goal programming with preemptive priorities provides a useful tool for developing a future year manpower plan under conflicting socio-econo-organizational objectives. Successful utilization requires a close management involvement in adjusting probabilities and specifying goals, priorities and impending policy changes. Such an approach is presented in this paper and illustrated by means of an industrial case study example. The presentation is kept simple, yet detailed and unified, so that is is easily understood by practitioners and students of operational research/management science.     

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.     

应用模糊目标规划方法求解多目标线性分式规划问题

针对多目标分式线性规划问题,提出利用上(下)界表示目标期望水平及允许上(下)限,且利用一阶泰勒公式逼近隶属函数,将多目标分式规划转化为线性规划问题,并用单纯形法求解,通过实验算例说明了所提出的方法的有效性.     

整数规划的布谷鸟算法

布谷鸟搜索算法是一种新型的智能优化算法．本文采用截断取整的方法将基本布谷鸟搜索算法用于求解整数规划问题．通过对标准测试函数进行仿真实验并与粒子群算法进行比较,结果表明本文所提算法比粒子群算法拥有更好的性能和更强的全局寻优能力,可以作为一种实用方法用于求解整数规划问题．     

求解线性规划问题的一种全搜索方法

在[1]基础上提出一个全搜索方法,它通常只需迭代一、二次,即可得到一个基可行解,之后依据最优性条件进行的寻优迭代,也较[2]的搜索方位更多,从而总体上效果更好。     

目标规划法在证券组合投资中的应用

证券投资是目前我国经济中的一大热点。本以Markowitz证券组合投资理论为基础，运用目标规划的方法建立一种新的证券组合投资决策模型。在本模型中综合考虑了证券组合的收益，风险，交易费用等因素，对投资选择有效证券组合有一定的实用价值。     

Goal Programming Approach to a Type of Quality Control Problem

Fixing the levels of inputs and process variables in order to meet a required specification of output is a common quality control problem. However difficulties can arise when the output has a number of characteristics and when each of these characteristics has to satisfy a specification. Such a problem was met in a paper manufacturing factory and the problem was solved using Goal Programming (GP). The method can be applied to other process control problems and this paper gives the GP formulation of the general process control problem. The paper also gives details of the case study from which the method was developed.     

混合模式下U型装配线平衡问题的目标规划求解

装配线平衡对于提高装配效率和降低装配成本都有重要意义。为了满足顾客需求的多样化和减少成本，通常采用混合模式的装配线。本文针对混合模式下U型装配线平衡问题，提出一个目标规划法以求解该问题，量化示例表明所提方法是有效的。     

目标规划在离散型动态投入产出模型中的应用

以离散型动态投入产出模型为约束条件的主体、以决策部门所希望达到的种种目标为约束条件的附加部分,建立动态投入产出目标规划模型.通过求解动态投入产出目标规划模型而得到离散型动态投入产出模型的解.此解法与其它解法相比具有更大的实用价值.