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

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A New Interval-Valued Hesitant Fuzzy-Based Optimization Method

引用

NEW MATHEMATICS AND NATURAL COMPUTATION 2022年第2期18卷 469-494页

作者： Bharati, Shailendra Kumar Univ Delhi Kamala Nehru Coll Dept Math Delhi 110049 India

An interval-valued hesitant fuzzy set (IVHFS) is a best tool to address uncertainty and hesitation of a production planning problem (PPP) which appears in engineering, agriculture, and industrial sectors. Often, a PPP is formulated as a multiobjective linear programming problem (MOLPP) and therefore, it is very necessary to develop a suitable and realistic method to deal MOLPP with uncertainty and hesitation. In this paper, we define a set of possible interval-valued hesitant fuzzy degrees for all objectives, and using this, a MOLPP is converted into a interval-valued hesitant fuzzy linear programming (IVHFLPP). Further, we introduce a new optimization technique based on a new operation of IVHFS, and later it is implemented in a computational method to search a Pareto optimal solution of the considered problem. Further, a PPP is solved by using the proposed method and the result shows the superiority of the proposed computational method over the existing methods.

关键词： Fuzzy sets interval-valued hesitant fuzzy sets linear programming multiobjective programming uncertainty and hesitation

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

An Interactive Evolutionary multiobjective Optimization Method: Interactive WASF-GA 8

An Interactive Evolutionary Multiobjective Optimization Meth...

引用

8th International Conference on Evolutionary Multi-Criterion Optimization (EMO)

作者： Ruizi, Ana B. Luque, Mariano Miettinen, Kaisa Saborido, Ruben Univ Malaga Dept Appl Econ Math E-29071 Malaga Spain Univ Jyvaskyla Dept Math Informat Technol Jyvaskyla Finland Ecole Polytech Polytechn Montreal Researchers Software Engn Montreal PQ H3C 3A7 Canada

ISBN: (纸本)9783319158921;9783319158914

In this paper, we describe an interactive evolutionary algorithm called Interactive WASF-GA to solve multiobjective optimization problems. This algorithm is based on a preference-based evolutionary multiobjective optimization algorithm called WASF-GA. In Interactive WASF-GA, a decision maker provides preference information at each iteration simply as a reference point consisting of desirable objective function values and the number of solutions to be compared. Using this information, the desired number of solutions is generated to represent the region of interest of the Pareto optimal front associated to the reference point given. Interactive WASF-GA implies a much lower computational cost than the original WASF-GA because it generates a small number of solutions. This speeds up the convergence of the algorithm, making it suitable for many decision-making problems. Its efficiency and usefulness is demonstrated with a five-objective optimization problem.

关键词： multiobjective programming Pareto optimal solutions Reference point approach Interactive methods Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

Necessary Optimality Conditions for Vector Reverse Convex Minimization Problems via a Conjugate Duality

引用

VIETNAM JOURNAL OF MATHEMATICS 2024年第1期52卷 265-282页

作者： Keraoui, Houda Aboussoror, Abdelmalek Univ Cadi Ayyad Lab Modelisat Syst Complexes ENSA BP 575Ave Abdelkrim Khattabi Marrakech 40000 Morocco Univ Cadi Ayyad Fac Sci Semlalia Blvd Prince My AbdellahBP 2390 Marrakech 40000 Morocco

In this paper, we are concerned with a vector reverse convex minimization problem (P). For such a problem, by means of the so-called Fenchel-Lagrange duality, we provide nec-essary optimality conditions for proper efficiency in the sense of Geoffrion. This duality is used after a decomposition of problem (P) into a family of convex vector minimization sub-problems and scalarization of these subproblems. The optimality conditions are expressed in terms of subdifferentials and normal cones in the sense of convex analysis. The obtained results are new in the literature of vector reverse convex programming. Moreover, some of them extend with improvement some similar results given in the literature, from the scalar case to the vectorial one.

关键词： multiobjective programming Reverse convex programming Convex programming Optimality conditions Primary Secondary

来源：评论

学校读者我要写书评

暂无评论

RESEARCH ON COMPREHENSIVE QUALITY EVALUATION METHOD BASED ON COOPERATIVE PERFORMANCE 18

RESEARCH ON COMPREHENSIVE QUALITY EVALUATION METHOD BASED ON...

引用

International Conference on Machine Learning and Cybernetics (IMLC)

作者： Wang, Cheng-Bin Li, Fa-Chao Hebei Univ Sci & Technol Sch Econ & Management Shijiazhuang Hebei Peoples R China

ISBN: (纸本)9781728128160

Comprehensive quality evaluation is the measure of the members' comprehensive ability and the premise and foundation of improving the team's operation efficiency. How to accurately obtain the comprehensive quality of members has been a widely concerned issue in the academic and application fields. Taking cooperative performance as the main observation index, this paper proposes a comprehensive quality evaluation model based on cooperative performance, and analyzes the characteristics and shortcomings of this model. In order to solve the problem that the solution cannot be guaranteed, the method of multi objective programming is applied to give the solution strategy based on the deviation variable. Finally, the feasibility and effectiveness of the model are analyzed with a case study. Theoretical analysis and example calculation show that the model has good interpretability and operability, which not only improves the existing evaluation methods to a certain extent, but also has wide application value in the fields of resource allocation, artificial intelligence and recommendation system.

关键词： Cooperation performance multiobjective programming Evaluation model Comprehensive quality

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：