Allocating resources to competing projects is typically driven by multiple quantified objectives generated from the top-level goals of a large-scale system. Analytical tools to aid such allocations have a significant ...
详细信息
Allocating resources to competing projects is typically driven by multiple quantified objectives generated from the top-level goals of a large-scale system. Analytical tools to aid such allocations have a significant history with many existing methodologies, particularly for optimization and programming within a hierarchy of objective functions. However, the quantified objective functions are known to only partially represent the system goals, and significant challenges remain to preserve relevant considerations that resisted quantification. In particular, the patterns of allocation of resources across the goals may be important to decision-makers, since they could thereby address known, quantifiable issues with some consideration of unknown and emergent issues. This paper develops decision-aiding diagrams of top-level goals and resources that complement the existing multiobjective combinatorial optimization models, to better refine and choose among the optimization-generated portfolios of projects. Adapting existing path diagrams from the social sciences, the newly developed methodology can be subordinate to the generation of Pareto-optimal solutions via the optimization model. The application of path diagrams is demonstrated through a case study of allocating resources to a large-scale system of airports. (C) 2010 Wiley Periodicals, Inc. Syst Eng 14: 73-86, 2011
Wolfe and Mond-Weir type nondifferentiable multiobjective symmetric dual programs are formulated over arbitrary cones and appropriate duality theorems are established under K-preinvexity/K-convexity/pseudoinvexity ass...
详细信息
Wolfe and Mond-Weir type nondifferentiable multiobjective symmetric dual programs are formulated over arbitrary cones and appropriate duality theorems are established under K-preinvexity/K-convexity/pseudoinvexity assumptions. (C) 2011 Elsevier Ltd. All rights reserved.
This paper extends the defensive location problem (DLP), proposed by Uno and Katagiri, considering the situations that the defender locates defensive facilities for preventing invaders from reaching some important ver...
详细信息
ISBN:
(纸本)9781424473175
This paper extends the defensive location problem (DLP), proposed by Uno and Katagiri, considering the situations that the defender locates defensive facilities for preventing invaders from reaching some important vertices in a network. Their DLPs assumed that invaders, with a given energy, exist on a given vertex in it. On the other hand, this paper considers a new DLP that invaders' sites and energies are given uncertainly. By representing their existing vertices and energies as random variables with scenarios, the new DLP can be formulated as a multiobjective bilevel stochastic programming problem. In order to find a satisficing solution of the decision maker for the multiobjective DLP, an interactive fuzzy satisficing method with tabu search algorithm based on strategic oscillation is proposed. The efficiency of the proposed method is shown by applying it to numerical examples of the DLPs.
A new generalized class of higher-order (F, alpha, rho, d)-type I functions is introduced, and a general Mond-Weir type higher-order dual is formulated for a nondifferentiable multiobjective programming problem. Based...
详细信息
A new generalized class of higher-order (F, alpha, rho, d)-type I functions is introduced, and a general Mond-Weir type higher-order dual is formulated for a nondifferentiable multiobjective programming problem. Based on the concepts introduced, various higher-order duality results are established. At the end, some special cases are also discussed.
Confronted with problems of most routing algorithms with multiple QoS constraints,the mathematical model of routing is built up based on multiobjective programming and differentiated transactions,which can meet Multip...
详细信息
Confronted with problems of most routing algorithms with multiple QoS constraints,the mathematical model of routing is built up based on multiobjective programming and differentiated transactions,which can meet Multiple QoS requirements and improve network resource utility *** Fallback+ algorithm is extended and improved further,a new Fallback++ algorithm has been proposed,which can not only meet multiple QoS requirements but also utilize network resource *** complexity and space complexity of the algorithm are all analyzed as O(n*N2).The efficiency and correctness of the model and algorithm are validated by simulation.
Conducting concrete mix proportion design and experiment by uniform design;enabling the formula to fit with the experimental data through stepwise regression analysis;paying attention to the economic cost as the o...
详细信息
Conducting concrete mix proportion design and experiment by uniform design;enabling the formula to fit with the experimental data through stepwise regression analysis;paying attention to the economic cost as the objective function;achieving the optimization of concrete mix proportion by using multiobjective programming methods. Mixing concrete by following these methods, one can reduce the cost, save energy and produce considerable practical value in projects.
In this paper, a pair of Mond-Weir type multiobjective higher-order symmetric dual programs over arbitrary cones is formulated and usual duality results are established under higher-order K-preinvexity/K-pseudoinvexit...
详细信息
In this paper, a pair of Mond-Weir type multiobjective higher-order symmetric dual programs over arbitrary cones is formulated and usual duality results are established under higher-order K-preinvexity/K-pseudoinvexity assumptions. Symmetric minimax mixed integer primal and dual problems are also discussed. (C) 2010 Elsevier Ltd. All rights reserved.
A pair of Wolfe type multiobjective second order symmetric dual programs with cone constraints is formulated and usual duality results are established under second order invexity assumptions. These results are then us...
详细信息
A pair of Wolfe type multiobjective second order symmetric dual programs with cone constraints is formulated and usual duality results are established under second order invexity assumptions. These results are then used to investigate symmetric duality for minimax version of multiobjective second order symmetric dual programs wherein some of the primal and dual variables are constrained to belong to some arbitrary sets, i.e., the sets of integers. This paper points out certain omissions and inconsistencies in the earlier work of Mishra [S.K. Mishra, multiobjective second order symmetric duality with cone constraints, European journal of Operational Research 126 (2000) 675-682] and Mishra and Wang [S.K. Mishra, S.Y. Wang, Second order symmetric duality for nonlinear multiobjective mixed integer programming, European journal of Operational Research 161 (2005) 673-682]. (C) 2009 Elsevier B.V. All rights reserved.
The allocation of water in a multicountry river system necessarily involves conflicting objectives, where increasing water benefits for one country entails losses for other countries. This paper presents the formulati...
详细信息
The allocation of water in a multicountry river system necessarily involves conflicting objectives, where increasing water benefits for one country entails losses for other countries. This paper presents the formulation and application of a multiobjective linear programming model, where each objective represents the benefits for a country from using water for agriculture, urban consumption. and energy production, net of conveyance costs. This model is applied to the Euphrates and Tigris River basin and its three riparian countries-Turkey, Syria, and Iraq. The model is used to delineate the set of nondominated Solutions (Pareto frontier), and is extended to include political factors and distributional constraints, leading to ail allocation of basin water and resulting benefits.
In this paper, a pair of Mond-Weir type nondifferentiable multiobjective second-order symmetric dual programs over arbitrary cones is formulated. Weak, strong and converse duality theorems are established under second...
详细信息
In this paper, a pair of Mond-Weir type nondifferentiable multiobjective second-order symmetric dual programs over arbitrary cones is formulated. Weak, strong and converse duality theorems are established under second-order K-F-convexity/K-eta-bonvexity assumptions. A self duality theorem is also obtained by assuming the functions involved to be skew-symmetric.
暂无评论