首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
An interactive approach for solving bi-objective optimisation problems with multiple decision-makers in a context where the decisions are made via the strict majority voting rule is proposed. An adequate use of projection and decomposition techniques leads to a hierarchical algorithm in which the upper level is represented by a relaxed version of the bi-objective problem in the objective space. The feasibility of the partial consensus obtained in the upper (decision) level by the strict majority voting rule is tested in the lower (analysis) level of the algorithm. Some properties of the relaxed bi-objective problem allow that different preference structures of the decision-makers can be represented by appropriate multiobjective methods. The paper includes numerical examples that illustrate the characteristics of the approach proposed.  相似文献   

2.
In this paper, we consider a multiobjective two-level linear programming problem in which the decision maker at each level has multiple-objective functions conflicting with each other. The decision maker at the upper level must take account of multiple or infinite rational responses of the decision maker at the lower level in the problem. We examine three kinds of situations based on anticipation of the decision maker at the upper level: optimistic anticipation, pessimistic anticipation, and anticipation arising from the past behavior of the decision maker at the lower level. Mathematical programming problems for obtaining the Stackelberg solutions based on the three kinds of anticipation are formulated and algorithms for solving the problems are presented. Illustrative numerical examples are provided to understand the geometrical properties of the solutions and demonstrate the feasibility of the proposed methods.  相似文献   

3.
In this paper we consider the solution of a bi-level linear fractional programming problem (BLLFPP) by weighting method. A non-dominated solution set is obtained by this method. In this article decision makers (DMs) provide their preference bounds to the decision variables that is the upper and lower bounds to the decision variables they control. We convert the hierarchical system into scalar optimization problem (SOP) by finding proper weights using the analytic hierarchy process (AHP) so that objective functions of both levels can be combined into one objective function. Here the relative weights represent the relative importance of the objective functions.  相似文献   

4.
This paper solves the multiobjective stochastic linear program with partially known probability. We address the case where the probability distribution is defined by crisp inequalities. We propose a chance constrained approach and a compromise programming approach to transform the multiobjective stochastic linear program with linear partial information on probability distribution into its equivalent uniobjective problem. The resulting program is then solved using the modified L-shaped method. We illustrate our results by an example.  相似文献   

5.
本文用模糊集理论中的隶属函数描述多层线性规划的各层目标,在第一层给定最小满意水平下,通过求解相应层次的模糊规划来确定各层的最小满意度,从而最终得到问题的一个满意解。提出的方法只需求解一系列线性规划问题,具有较好的计算复杂性和可行性,最后的算例进一步验证了方法的有效性。  相似文献   

6.
This paper investigates the transit passenger origin–destination (O–D) estimation problem in congested transit networks where updated passenger counts and outdated O–D matrices are available. The bi-level programming approach is used for the transit passenger O–D estimation problem. The upper level minimizes the sum of error measurements in passenger counts and O–D matrices, and the lower level is a new frequency-based stochastic user equilibrium (SUE) assignment model that can determine simultaneously the passenger overload delays and passenger route choices in congested transit network together with the resultant transit line frequencies. The lower-level problem can be formulated as either a logit-type or probit-type SUE transit assignment problem. A heuristic solution algorithm is developed for solving the proposed bi-level programming model which is applicable to congested transit networks. Finally, a case study on a simplified transit network connecting Kowloon urban area and the Hong Kong International Airport is provided to illustrate the applications of the proposed bi-level programming model and solution algorithm. This revised version was published online in July 2006 with corrections to the Cover Date.  相似文献   

7.
This paper proposes a fuzzy-robust stochastic multiobjective programming (FRSMOP) approach, which integrates fuzzy-robust linear programming and stochastic linear programming into a general multiobjective programming framework. A chosen number of noninferior solutions can be generated for reflecting the decision-makers’ preferences and subjectivity. The FRSMOP method can effectively deal with the uncertainties in the parameters expressed as fuzzy membership functions and probability distribution. The robustness of the optimization processes and solutions can be significantly enhanced through dimensional enlargement of the fuzzy constraints. The developed FRSMOP was then applied to a case study of planning petroleum waste-flow-allocation options and managing the related activities in an integrated petroleum waste management system under uncertainty. Two objectives are considered: minimization of system cost and minimization of waste flows directly to landfill. Lower waste flows directly to landfill would lead to higher system costs due to high transportation and operational costs for recycling and incinerating facilities, while higher waste flows directly to landfill corresponding to lower system costs could not meet waste diversion objective environmentally. The results indicate that uncertainties and complexities can be effectively reflected, and useful information can be generated for providing decision support.  相似文献   

8.
In this paper, a multiobjective quadratic programming problem having fuzzy random coefficients matrix in the objective and constraints and the decision vector are fuzzy pseudorandom variables is considered. First, we show that the efficient solutions of fuzzy quadratic multiobjective programming problems are resolved into series-optimal-solutions of relative scalar fuzzy quadratic programming. Some theorems are proved to find an optimal solution of the relative scalar quadratic multiobjective programming with fuzzy coefficients, having decision vectors as fuzzy variables. At the end, numerical examples are illustrated in the support of the obtained results.  相似文献   

9.
When solving a multiobjective programming problem by the weighted sum approach, weights represent the relative importance associated to the objectives. As these values are usually imprecise, it is important to analyze the sensitivity of the solution under possible deviations on the estimated values. In this sense, the tolerance approach provides a direct measure of how weights may vary simultaneously and independently from their estimated values while still retaining the same efficient solution. This paper provides an explicit expression to the maximum tolerance on weights in a multiobjective linear fractional programming problem when all the denominators are equal. An application is also presented to illustrate how the results may help the decision maker to choose a most satisfactory solution in a production problem.  相似文献   

10.
The business environment is full of uncertainty. Allocating the wealth among various asset classes may lower the risk of overall portfolio and increase the potential for more benefit over the long term. In this paper, we propose a mixed single-stage R&D projects and multi-stage securities portfolio selection model. Specifically, we present a bi-objective mixed-integer stochastic programming model. Moreover, we use semi-absolute deviation risk functions to measure the risk of mixed asset portfolio. Based on the idea of moments approximation method via linear programming, we propose a scenario generation approach for the mixed single-stage R&D projects and multi-stage securities portfolio selection problem. The bi-objective mixed-integer stochastic programming problem can be solved by transforming it into a single objective mixed-integer stochastic programming problem. A numerical example is given to illustrate the behavior of the proposed mixed single stage R&D projects and multi-stage securities portfolio selection model.  相似文献   

11.
In this paper we develop a general approach to generate all non-dominated solutions of the multi-objective integer programming (MOIP) Problem. Our approach, which is based on the identification of objective efficiency ranges, is an improvement over classical ε-constraint method. Objective efficiency ranges are identified by solving simpler MOIP problems with fewer objectives. We first provide the classical ε-constraint method on the bi-objective integer programming problem for the sake of completeness and comment on its efficiency. Then present our method on tri-objective integer programming problem and then extend it to the general MOIP problem with k objectives. A numerical example considering tri-objective assignment problem is also provided.  相似文献   

12.
This paper studies a special bi-level programming problem that arises from the dealings of a Natural Gas Shipping Company and the Pipeline Operator, with facilities of the latter used by the former. Because of the business relationships between these two actors, the timing and objectives of their decision-making process are different and sometimes even opposed. In order to model that, bi-level programming was traditionally used in previous works. Later, the problem was expanded and theoretically studied to facilitate its solution; this included extension of the upper level objective function, linear reformulation, heuristic approaches, and branch-and-bound techniques. In this paper, we present a linear programming reformulation of the latest version of the model, which is significantly faster to solve when implemented computationally. More importantly, this new formulation makes it easier to analyze the problem theoretically, allowing us to draw some conclusions about the nature of the solution of the modified problem. Numerical results concerning the running time, convergence, and optimal values, are presented and compared to previous reports, showing a significant improvement in speed without actual sacrifice of the solution’s quality.  相似文献   

13.
This study presents a framework for solving a sealed-bid, multi-issue, and multi-sourcing reverse auction problem in which negotiation takes place between the buyer and the suppliers during the bidding process. The problem is formulated as a bi-level distributed programming model in which the buyer is the upper level decision maker, while suppliers at the lower level make decisions independent of each other. The negotiation process between the buyer and the suppliers is facilitated via the iterative exchange of decision information between the upper and lower levels of the model. The outcome of the sealed-bid auction is determined using an algorithm designed to establish the optimum quantity allocation and delivery time at the upper level and the corresponding optimized production plans at the lower level. The feasibility of the proposed approach is demonstrated via an illustrative example.  相似文献   

14.
In this paper, a graphical characterization, in the decision space, of the properly efficient solutions of a convex multiobjective problem is derived. This characterization takes into account the relative position of the gradients of the objective functions and the active constraints at the given feasible solution. The unconstrained case with two objective functions and with any number of functions and the general constrained case are studied separately. In some cases, these results can provide a visualization of the efficient set, for problems with two or three variables. Besides, a proper efficiency test for general convex multiobjective problems is derived, which consists of solving a single linear optimization problem.  相似文献   

15.
Let a multiobjective linear programming problem and any efficient solution be given. Tolerance analysis aims to compute interval tolerances for (possibly all) objective function coefficients such that the efficient solution remains efficient for any perturbation of the coefficients within the computed intervals. The known methods either yield tolerances that are not the maximal possible ones, or they consider perturbations of weights of the weighted sum scalarization only. We focus directly on perturbations of the objective function coefficients, which makes the approach independent on a scalarization technique used. In this paper, we propose a method for calculating the supremal tolerance (the maximal one need not exist). The main disadvantage of the method is the exponential running time in the worst case. Nevertheless, we show that the problem of determining the maximal/supremal tolerance is NP-hard, so an efficient (polynomial time) procedure is not likely to exist. We illustrate our approach on examples and present an application in transportation problems. Since the maximal tolerance may be small, we extend the notion to individual lower and upper tolerances for each objective function coefficient. An algorithm for computing maximal individual tolerances is proposed.  相似文献   

16.
17.
The main goal of supply chain management is to coordinate and collaborate the supply chain partners seamlessly. On the other hand, bi-level linear programming is a technique for modeling decentralized decision. It consists of the upper level and lower level objectives. Thus, this paper intends to apply bi-level linear programming to supply chain distribution problem and develop an efficient method based on hybrid of genetic algorithm (GA) and particle swarm optimization (PSO). The performance of the proposed method is ascertained by comparing the results with GA and PSO using four problems in the literature and a supply chain distribution model.  相似文献   

18.
下层问题以上层决策变量作为参数,而上层是以下层问题的最优值作为响应 的一类最优化问题——二层规划问题。我们给出了由一系列此类二层规划去逼近原二层规划的逼近法,得到了这种逼近的一些有趣的结果.  相似文献   

19.
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.  相似文献   

20.
We formulate and study a multiobjective programming approach for production processes which implements suitable constraints on pollutant emissions. We consider two alternative optimization problems: (a) minimum pollution risk; (b) maximum expected return. For each pollutant, we define three different contamination levels: (a) the desirable or the target pollution level, (b) the alarm (warning or critical) level and (c) the maximum admissible (acceptable) level, and introduce penalties proportional to the amounts of pollutants that exceed these levels. The objective function of the minimum pollution risk problem is not smooth since it contains positive parts of some affine functions, resulting in mathematical difficulties, which can be solved by formulating an alternative linear programming model, which makes use of additional variables and has the same solutions as the initial problem. We investigate various particular cases and analyze a numerical example for a textile plant.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号