检索结果-内蒙古大学图书馆

ISEIS International Conference on Environmental Informatics

作者： Chen, Bing Guo, Huaicheng Huang, Guohe Yin, Yongyuan Zhang, Baiyu N China Elect Power Univ Energy & Environm Res Ctr Beijing 102206 Peoples R China Univ British Columbia Inst Resources Environm & Sustainabil Vancouver BC V6T 124 Canada Peking Univ Ctr Environm Sci Beijing 100871 Peoples R China Dalhousie Univ Dept Civil Engn Halifax NS B3J 1Z1 Canada

As a complex system, the urban environment usually presents multiobjective, uncertain, and dynamic characteristics, which leads to difficulties in urban environmental planning. In this study, an interval fuzzy multiobjective programming method is proposed for tackling such problems and the associated solution algorithm is also discussed. Based on the proposed method, an interval fuzzy multiobjective environment planning model is further developed with specific focus on urban systems. The proposed approach allows uncertainties and comprehensive interaction of system components to be effectively communicated into the optimisation process. Furthermore, using scenario analysis and interactive solution processes, stakeholder preferences are efficiently integrated, promoting feasibility and robustness of decisions. The developed model was tested by a real-world case study in Kunming City, China. An analysis of the results shows that the proposed approach is an effective means for urban environmental planning.

关键词： decision making interval fuzzy multiobjective programming environmental planning urban systems

来源：评论

学校读者我要写书评

暂无评论

Lagrange multipliers for pareto nonsmooth programming problems in banach spaces

引用

Optimization 1992年第3-4期26卷 277-285页

作者： El Abdouni, B. Thibault, L. Dept. Mathématiques Faculté des Sciences Université de Rabat Rabat Maroc Morocco Universite Montpellier II Dept. Mathmatiques Montpellier France

We establish the existence of Lagrange multipliers for general Pareto multiobjective mathematical programming problems in Banach spaces. Here the data are general nonsmooth strongly compactly Lipschitzian mappings. &#... 详细信息

关键词： Lagrange multipliers multiobjective programming nonsmooth problems

来源：评论

学校读者我要写书评

暂无评论

Possibilistic Mean Models for Linear programming Problems with Discrete Fuzzy Random Variables

Possibilistic Mean Models for Linear Programming Problems wi...

引用

IEEE International Conference on Systems, Man, and Cybernetics (SMC)

作者： Katagiri, Hideki Uno, Takeshi Kato, Kosuke Hiroshima Univ Grad Sch Engn 1-4-1 Kagamiyama Higashihiroshima 7398527 Japan Univ Tokushima Inst Socio Arts & Sci Tokushima 7708502 Japan Hiroshima Inst Technol Fac Appl Informat Sci Hiroshima 7315193 Japan

ISBN: (纸本)9781479906529

This paper considers linear programming problems where objective functions involve fuzzy random variables. New decision making models, called possibilistic mean model, are proposed in order to maximize the mean (expectation) of the degrees of possibility and necessity with respect to attained objective function values. It is shown that the original fuzzy random programming problems are transformed into deterministic nonlinear ones which can be solved by conventional nonlinear programming techniques.

关键词： fuzzy random variable multiobjective programming possibility measure necessity measure

来源：评论

学校读者我要写书评

暂无评论

Approximately efficient solutions in vector optimization

引用

Journal of Multi-Criteria Decision Analysis 1996年第4期5卷 271-278页

作者： Tanaka, Tamaki Department of Information Science Faculty of Science Hirosaki University Hirosaki 036 Japan

An approach to approximating solutions in vector optimization is developed for vector optimization problems with arbitrary ordering cones. This paper presents a study of approximately efficient points of a given set with respect to a convex cone in an ordered Banach space. Existence results for such approximately efficient points are obtained. A domination property related to these existence results is observed and then it is proved that each element of a given set is approximated by the sum of a point in a convex cone inducing the ordering and a point in a finite set consisting of such approximately efficient points of the set. © 1996 John Wiley & Sons, Ltd.

关键词： Approximately efficient solutions Approximation Domination property Efficient points multiobjective programming Vector optimization ε-solutions

来源：评论

学校读者我要写书评

暂无评论

An interactive algorithm based on the weighed maximum distance

引用

Trabajos de Investigacion Operativa 1987年第1期2卷 81-92页

作者： Martín, Carlos González Departamento de Estadística e I.O. Facultad de Matemáticas Universidad de La Laguna La Laguna Spain

Starting of the decision maker's local preferences, these emitted in the shape of certain satisfactory levels for the objectives, we build an interactive algorithm generating efficient balanced points, in which the weighed maximum distance between the feasible region and the ideal point is got to be minimized. For this algorithm we have proved the convergency. © 1987 SEIO.

关键词： A.M.S. Classification (1980): 90C99 interactive methods multiobjective programming satisfactory levels weighed maximum distance

来源：评论

学校读者我要写书评

暂无评论

Invex nonsmooth alternative theorem and applications

引用

Optimization 2000年第2期48卷 239-253页

作者： Brandao, A.J.V. Rojas-Medar, M.A. Silva, G.N. DMA IMECC UNICAMP 13081-970 Campinas-SP CP 6065 Brazil DCCE UNESP 15054-000 S J Rio Preto-SP CP 136 Brazil

An invex constrained nonsmooth optimization problem is considered, in which the presence of an abstract constraint set is possibly allowed. Necessary and sufficient conditions of optimality are provided and weak and strong duality results established. Following Geoffrion's approach an invex nonsmooth alternative theorem of Gordan type is then derived. Subsequently, some applications on multiobjective programming are then pursued. © 2000 OPA (Overseas Publishers Association) N.V. Published by license under the Gordon and Breach Science Publishers imprint.

关键词： Alternative theorem Invexity multiobjective programming Nonsmooth analysis

来源：评论

学校读者我要写书评

暂无评论

Pareto optimal solutions providing optimal routes between every two different nodes in the cost-time trade-off routing network without the objectives being prioritized

引用

OPSEARCH 2016年第4期53卷 778-807页

作者： Prakash, Satya Gupta, Anuj Garg, Richa Tanwar, Bhuvnesh Kaushik, Deepika Aggarwal, Sourabh Amity Sch Engn & Technol 580 Delhi Palam Vihar Rd New Delhi 110061 India Flat 6 2 Tavistock Rd Croydon CR0 2AS England

A cost-time trade-off routing network problem is considered. In the network, each arc is associated with an ordered pair whose first component is the cost and the second component is the time of direct travel between two adjacent nodes. The cost-time trade-off routing network problem has two objectives without being prioritized. The objectives are to minimize the total cost and total time of travel between every two different nodes in the network. It is required to find all the Pareto optimal routes between every two different nodes in the network. An algorithm is developed for finding the set of Pareto optimal solutions providing all the optimal routes between every two different nodes in the network. The new algorithm extends Floyd's algorithm, presently applicable only for solving the single-objective routing network problem, to solve the cost-time trade-off routing network problem, incorporating the concept of lexicographically lesser between two ordered pairs. The problem is solved in two phases. In the first phase, the cost-time trade-off routing network problem is represented by a square matrix whose rows and columns are equal to the number of nodes and whose entries are ordered pairs associated with the arcs in the network. In the second phase, the set of Pareto optimal solutions of the cost-time trade-off routing network problem is obtained through solving a sequence of prioritized bicriterion problems. The new algorithm is explained and is illustrated through solving a numerical example. Utility of the work is also indicated.

关键词： Optimization multiobjective programming Bicriterion Pareto optimal solution Floyd's algorithm

来源：评论

学校读者我要写书评

暂无评论

On-line Monitoring and Optimization of Performance Indexes for Limestone Wet Desulfurization Technology

On-line Monitoring and Optimization of Performance Indexes f...

引用

International Conference on Sustainable Energy and Environmental Engineering (ICSEEE 2012)

作者： Hou, Pengfei Bai, Jianyun Yin, Jiang Shanxi Univ Engn Coll Taiyuan 030013 Shanxi Peoples R China

ISBN: (纸本)9783037856499

Taking No.11 flue gas desulfurization (FGD) site in Taiyuan Second Thermal Power Plant (TSTPP) as an example, the authors respectively deduced the models of technical performance indexes including SO2 removal efficiency and outlet SO2 concentration and the models of economical performance indexes including limestone consumption, power consumption and process water consumption. Then, by using the least square linear and nonlinear regression method, the authors obtained the practical mathematic models in the period of 21:00, Mar. 28th and 3:00, Mar. 29th, 2007. Finally, the authors calculated the optimal solutions of slurry pH value, calcium-sulfur (Ca/S) mole ratio and liquid-gas (L/G) ratio by utilizing the multiobjective programming method. Using this method, the desulfurization system works safely and economically.

关键词： wet desulfurization optimization performance index regression analysis multiobjective programming

来源：评论

学校读者我要写书评

暂无评论

Some results on symmetric duality of multiobjective programmes with generalized (F,ρ) invexity

Some results on symmetric duality of multiobjective programm...

引用

2nd Euro-Japanese Workshop on Stochastic Modelling for Finance Insurance Production and Reliability

作者： Ojha, DB Mukherjee, RN Banaras Hindu Univ Inst Technol Dept Appl Math Varanasi 221005 Uttar Pradesh India

In this present article we have given some multiobjective programming problems with their symmetric duals and have derived weak and strong duality results with respect to such programs. Moreover, we have also used most general type of invexity assumptions involved with the functions which are related to the programming problems. It is to be pointed out that the objective functions in such programs contain terms like support functions which in turn are able to give results on particular classes of programs involving quadratic terms. Our results in particular give as special cases some earlier results on symmetric duals given in the current literature. (c) 2004 Published by Elsevier B.V.

关键词： multiobjective programming symmetric duality generalized (F, rho) invexity

来源：评论

学校读者我要写书评

暂无评论

Designing content distribution networks for optimal cost and performance

引用

INFORMATION TECHNOLOGY & MANAGEMENT 2012年第1期13卷 1-15页

作者： Deane, Jason K. Rakes, Terry R. Agarwal, Anurag Univ S Florida Dept Informat Syst & Decis Sci Coll Business Adm Sarasota FL 34243 USA Virginia Tech Dept Business Informat Technol Pamplin Coll Business Blacksburg VA 24061 USA

One strategy for alleviating excess latency (delay) in the Internet is the caching of web content at multiple locations. This reduces the number of hops necessary to reach the desired content. This strategy is used for web content such as html pages, images, streaming video, and Internet radio. The network of servers which store this content, and the collections of objects stored on each server, is called a content distribution network (CDN). In order to optimally design a CDN, given a network topology with available server storage capacity at various points in the network, one must decide which object collections to place on each server in order to achieve performance or cost objectives. The placements must be within the storage limits of the servers and must reflect the request patterns for each collection of objects to be cached. Researchers have suggested formulations for the CDN problem which address performance by minimizing latency (the average number of hops is a commonly accepted measure of latency) from client to content, or formulations that focus on minimizing cost of storage and/or bandwidth. In this research, we develop a model which allows for the simultaneous treatment of performance and cost, present examples to illustrate the application of the model and perform a detailed designed experiment to gain insights into cost/hops tradeoff for a variety of network parameters.

关键词： Content distribution networks multiobjective programming Integer programming Fuzzy sets

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：