Sawmills are a key element for the forest industry. It is not a simple task to plan correctly their production, taking into account that there are many criteria that are appropriate for their operation. Besides, the r...
详细信息
Sawmills are a key element for the forest industry. It is not a simple task to plan correctly their production, taking into account that there are many criteria that are appropriate for their operation. Besides, the results obtained from the use of different objectives present strong conflicts: the optimal value in a performance measure negatively affects the rest. Usual criteria, such as benefits, yield, productivity, inventory level, demand satisfaction, etc., generate very different solutions. Taking into account this context, this paper presents a formulation for the optimal planning of the daily production of sawmills. The problem is solved using a goal programming approach that allows different criteria to be appropriately weighted. Firstly, the magnitude of the conflicts among objectives is evaluated and then the proposed formulation using goal programming is applied to an example to show the ability of this proposal to balance different performance measures. This type of approach highlights the capability of the decision-maker, who must adjust different parameters to find a solution that fits the possibilities and requirements of the production plan and the context.
This paper examines the problem of capital budgeting in the area of highway maintenance. Emphasis is placed on specific, real-world user concerns relating to standard capital budgeting models, and suggestions are made...
详细信息
This paper examines the problem of capital budgeting in the area of highway maintenance. Emphasis is placed on specific, real-world user concerns relating to standard capital budgeting models, and suggestions are made for improving planning in this area. A two-phase approach to capital budgeting is suggested as a mechanism for resolving some of these concerns. In phase 1 a financial planning model is used as a means of determining appropriate budget levels. In phase 2 a goal programming model for achieving desired levels of service is given. A brief description is given of such a two-phase system currently being implemented in a Canadian transport ministry.
Recently, goal programming (GP) has been discussed in the literature as an alternative to linear programming, particularly in decision‐making environments involving multiple objectives. In this paper we present an ov...
详细信息
Recently, goal programming (GP) has been discussed in the literature as an alternative to linear programming, particularly in decision‐making environments involving multiple objectives. In this paper we present an overview of the different GP formulations, their assumptions, limitations, and implications for agricultural decision making. Furthermore, a new insight into the interpretation of duality in GP is discussed. The concept of “standardized dual variables” which provides a more meaningful interpretation of shadow prices in GP is introduced. A simple but realistic farm agricultural planning example is used to illustrate the analysis.Récemment, la technique de programmation appellée “goal programming” ou “GP” a été presentée dans la literature comme une alternative à la programmation Iinéaire, particulièrement dans les situations òu le procés de décision est basé sur plusieurs objectifs simultanés. Dans cet article nous présentons une vue génerale des différentes formes de la “GP;” leurs hypothèses de base. Ieurs limitations, et leurs implications pour le procés de decision agricole, une nouvelle intérpretation de la dualité en “GP” est proposée. En particulier, le concept de “variables duales standardisées” est introduit, ce qui permet une interpretation plus significative des prix de reference en “GP.” Finalement. un exemple simple mais réaliste de planification agrcole a l\' éche
作者：
Akbari, NegarJones, DylanArabikhan, FarzadUniv Portsmouth
Fac Business & Law Ctr Blue Governance Richmond BldgPortland St Portsmouth PO1 3DE Hants England Univ Portsmouth
Ctr Operat Res & Logist CORL Sch Math & Phys Lion Gate BldgLion Terrace Portsmouth PO1 3HF Hants England Univ Portsmouth
Sch Comp Buckingham Bldg Portsmouth PO1 3HE Hants England
In this paper, a strategic decision making model for the sustainable development of marine renewable energy is proposed, and a specific application to the United Kingdom (UK) is demonstrated. As an island nation the U...
详细信息
In this paper, a strategic decision making model for the sustainable development of marine renewable energy is proposed, and a specific application to the United Kingdom (UK) is demonstrated. As an island nation the UK benefits from significant marine energy potential which is providing an increasing contribution to UK's renewable energy portfolio. The paper investigates the question of how decision makers can be aided to reach a decision on which types of marine renewable energy projects should be chosen for development given that strategic energy planning is subject to a number of uncertain parameters and multiple sustainability objectives. In this context, the contribution of this paper lies in the combination of renewable energy portfolio selection and the application of multi-objective methods. Interval coefficient goal programming models are adopted in order to address the impreciseness and uncertainty associated with the goals and coefficients of the models in the context of renewable energy selection. The potential renewable energy projects are clustered in order to aid the decision making process and preferential weight sensitivity methods are employed. Conclusions are drawn for optimistic and pessimistic scenarios in the context of UK marine renewable energy planning. (C) 2020 Elsevier B.V. All rights reserved.
In conventional goal programming, the coefficients of objective functions and constraints, and target values are determined as crisp values. However, it is not frequent that the coefficients and the target values are ...
详细信息
In conventional goal programming, the coefficients of objective functions and constraints, and target values are determined as crisp values. However, it is not frequent that the coefficients and the target values are known precisely. In such cases, the coefficients and target values should be represented by intervals reflecting the imprecision. This paper treats goal programming problems in which coefficients and target values are given by intervals. It is shown that four formulations of the problems can be considered. The properties of the four formulated problems are investigated. An example is given to demonstrate the differences between the four formulations.
Over the last decades, the goal programming (GP) model has been applied to financial portfolio management and/or selection problem in decision-making contexts where several conflicting and incommensurable objectives a...
详细信息
Over the last decades, the goal programming (GP) model has been applied to financial portfolio management and/or selection problem in decision-making contexts where several conflicting and incommensurable objectives are simultaneously aggregated. The aim of this paper is to identify the research trends and publication outlets for the application of GP model to portfolio management. We point out an increasing interest and affirmation of more sophisticated models. We present a characterization of the existing GP variants and provide historical data and statistical analysis.
The Simplex algorithm together with the power of modern computers allows the use of goal programming based on large LP models for analyzing real world problems of respectable size and complexity. The Simplex has a bad...
详细信息
The Simplex algorithm together with the power of modern computers allows the use of goal programming based on large LP models for analyzing real world problems of respectable size and complexity. The Simplex has a bad property yet, when used for large disaggregate models and⧸or goal programming (GP) with numerous goals of comparable priority, especially if GP is used for pattern fitting. The Simplex discriminates systematically as many as possible of almost or fully equivalent activities or goals respectively. In addition the choice between fully equivalent activities is accidental (unpredictable). L 1 -Norm smoothing functions can be used to evade this problem.
This paper presents an application of the vector-maximum research [4–8] to the sensitivity analysis of goal programming problems as several of the criterion function penalty weights are simultaneously and independent...
详细信息
This paper presents an application of the vector-maximum research [4–8] to the sensitivity analysis of goal programming problems as several of the criterion function penalty weights are simultaneously and independently varied. A generalized goal programming capability is presented and a six-stage analytic procedure is described. The problem is generalized in the sense that the regular goal programming penalty weights can be expanded to intervals if desired. The solution procedure is new in that it depends upon an algorithm for the vector-maximum problem, “criterion cone” contraction procedures, and “filtering” techniques. Together they are able to generate and process all extreme points on the portion of the surface of the goal programming “augmented” feasible region corresponding to the interval penalty weights specified. In effect, the procedure and adapted algorithm of this paper delivers to goal programming an operational power of sensitivity analysis not previously available to users. A numerical example is provided in order to illustrate the computerized application of the total goal programming procedure outlined.
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 cat...
详细信息
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.
In this paper, authors devoted to study a fully fuzzy fractional multi-objective transportation problem by using goal programming approach. Also trapezoidal membership functions are applied to each objective function ...
详细信息
In this paper, authors devoted to study a fully fuzzy fractional multi-objective transportation problem by using goal programming approach. Also trapezoidal membership functions are applied to each objective function and constraints to describe a each fuzzy goal. A numerical example is provided to illustrate the efficiency of the multi-objective proposed approach.
暂无评论