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

Social transfer policies and child poverty in European countries: Evaluating policy alternatives through a multiobjective programming model

引用

SOCIO-ECONOMIC PLANNING SCIENCES 2024年 93卷

作者： Gonzalez-Gallardo, Sandra Barcena-Martin, Elena Perez-Moreno, Salvador Luque, Mariano Univ Malaga Dept Appl Econ Math Campus El Ejido Malaga 29071 Spain Univ Malaga Dept Appl Econ Stat & Econometr Campus El Ejido Malaga 29071 Spain Univ Malaga Dept Appl Econ Econ Policy Campus El Ejido Malaga 29071 Spain

Child poverty remains a significant concern across Europe and citizens regard policy interventions that effectively address this issue to be of utmost importance. In this work, we analyse the potential of social transfer policy alternatives to alleviate child and overall poverty simultaneously in European countries. Using a logistic regression to define the objective functions and constraints, we rely on multiobjective programming to assess key features of national social transfer systems that can minimize child and overall poverty and tend to equal both levels downwards. Taking into account the starting levels of each country, the results underline the importance of finding an adequate combination of pro-child and pro-poor targeting of social transfer policies. For most European countries, an increase in the level of cash benefits for children is advisable - particularly universal benefits - except in Croatia, the Netherlands, and Norway. Nonetheless, in France, Greece, Italy, Ireland, the Netherlands, and Spain, the recommended proportion of GDP allocated to universal cash benefits is lower than the proportion allocated to means-tested benefits. In this regard, our research provides an innovative approach for policymakers to optimize poverty reduction strategies by contributing valuable insights for the design and implementation of effective social transfer policies to combat child and overall poverty in European countries.

关键词： multiobjective programming Econometric analysis Child poverty Social transfer policy

来源：评论

学校读者我要写书评

暂无评论

Connectedness of Cone-efficient Solution Set for Cone-quasiconvex multiobjective programming in Hausdorff Topological Vector Spaces

引用

Chinese Quarterly Journal of Mathematics 2010年第1期25卷 132-139页

作者： ZHOU Xuan-wei School of Mathematics and Information Science Wenzhou University Wenzhou 325035 China

This paper deals with the connectedness of the cone-efficient solution set for vector optimization in locally convex Hausdorff topological vector spaces. The connectedness of the cone-efficient solution set is proved for multiobjective programming defined by a continuous one-to-one cone-quasiconvex mapping on a compact convex set of alternatives. During the proof, the generalized saddle theorem plays a key role.

关键词： multiobjective programming cone-efficient solution cone-quasiconvex mapping generalized saddle theorem connectedness

来源：评论

学校读者我要写书评

暂无评论

Routing algorithm with multiple QoS constraints based on multiobjective programming theory

Routing algorithm with multiple QoS constraints based on mul...

引用

2007年中国智能自动化会议

作者：冯杰姜宁杨即春 Deparement of Mathmatics Dalian University of Technology Operation Research Room Dalian Navel Academy Operation Research Room Dalian Navel Academy

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.

关键词： multiobjective programming differentiated transaction multiple QoS constraints routing algorithm simulation

来源：评论

学校读者我要写书评

暂无评论

A Novel Method for Solving Fuzzy multiobjective programming Based on Credibility Theory

A Novel Method for Solving Fuzzy MultiObjective Programming ...

引用

The Eleventh International Conference on Information and Management Sciences(IMS2012) in Celebrating of the 60th Birthday of Prof.Shu-Cherng Fang

作者： Mingfa Zheng~1,Guolin Yu~2,Bingjie Li~1,Guangxing Kou~1,Youshe Yang~1 1 College of Science,Air Force Engineering University,Xi'an,Shanxi,710051,China 2 Research Institute of Information and System Computation Science,Beifang Universityof Nationalities,Yinchuan,750021,China

Based on the credibility theory,this paper is devoted to the fuzzy multiobjective programming *** this purpose, we first present the expected value model of the fuzzy multiobjective programming problem and investigate its properties. To solve the problem,we design a theoretical method under the credibility measure,called the method of primary objective function,which transforms the multiobjective problem into the single objective ***,a numerical example is given to explain the method of primary objective function specifically. The theoretical results obtained in this paper can facilitate us to design algorithms to solve the FMOP problem.

关键词： fuzzy varible credibility measure multiobjective programming efficient solution

来源：评论

学校读者我要写书评

暂无评论

The compromise hypersphere for multiobjective linear programming

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2003年第3期144卷 459-479页

作者： Gass, SI Roy, PG Univ Maryland Robert H Smith Sch Business College Pk MD 20742 USA Univ Maryland Dept Math College Pk MD 20742 USA

For a linear-programming problem with q ( greater than or equal to 2) objective functions (that is, a multiobjective linear-programming problem), we propose a method for ranking the full set or a subset of efficient extreme-point solutions. The idea is to enclose the given efficient solutions, as represented by q-dimensional points in objective space, within an annulus of minimum width, where the width is determined by a hypersphere that minimizes the maximum deviation of the points from the surface of the hypersphere. We argue that the hypersphere represents a surface of compromise and that the point closest to its surface should be considered as the "best" compromise efficient solution. Also, given a ranked (sub)set of efficient solutions, a procedure is given that associates to each efficient solution a set of q positive weights that causes the efficient solution to be optimal with respect to the given set of efficient solutions. (C) 2002 Elsevier Science B.V. All rights reserved.

关键词： multiobjective programming compromise solution

来源：评论

学校读者我要写书评

暂无评论

A new mixed integer programming approach for optimization over the efficient set of a multiobjective linear programming problem

引用

OPTIMIZATION LETTERS 2020年第8期14卷 2323-2333页

作者： Lu, Kuan Mizuno, Shinji Shi, Jianming Tokyo Inst Technol 2 Chome-12-1 Ookayama Meguro Tokyo Japan Tokyo Univ Sci 1 Chome 3 Kagurazaka Shinjuku City Tokyo Japan

This paper concerns an optimization problem over the efficient set of a multiobjective linear programming problem. We propose and solve an equivalent mixed integer programming (MIP) problem to compute an optimal solution to the original problem. Compared with the previous MIP approach by Sun, the proposed approach relaxes a strong assumption and reduces the numbers of constraints and binary variables of the MIP problem. By conducting numerical experiments, we find that the proposed approach is more accurate and faster than the previous MIP approach. The proposed MIP problem can be efficiently solved with current state-of-the-art MIP solvers when the objective function is convex or linear.

关键词： Global optimization multiobjective programming Efficient set Linear complementarity conditions Mixed integer programming

来源：评论

学校读者我要写书评

暂无评论

Solution of multiobjective linear programming problems in interval-valued intuitionistic fuzzy environment

引用

SOFT COMPUTING 2019年第1期23卷 77-84页

作者： Bharati, S. K. Singh, S. R. Univ Delhi Kamala Nehru Coll Dept Math Delhi 110049 India Banaras Hindu Univ Inst Sci Dept Math Varanasi 221005 Uttar Pradesh India

The present paper gives a new computational algorithm for the solution of multiobjective linear programming (MOLP) problem in interval-valued intuitionistic fuzzy (IV-IF) environment. In MOLP problem which occurs in agricultural production planning, industrial planning and waste management. The parameters involved in real-life MOLP problems are impure, and several pioneer works have been done based on fuzzy or intuitionistic fuzzy sets for its compromise solutions. But many times the degree of membership and non-membership for certain element is not defined in exact numbers, so we observe another important kind of uncertainty. Thus fixed values of membership and non-membership cannot handle such uncertainty involved in real-life MOLP problem. Atanassov and Gargov first identified it and presented concept of IV-IF sets which is characterized by sub-intervals of unit interval. In this paper, we study IV-IF sets and develop a new computational method for the solution of real-life MOLP problems based on IV-IF sets. Further, the developed method has been presented in the form of a computational algorithm and implemented on a production problem, and solutions are compared with other existing methods.

关键词： multiobjective programming Interval-valued intuitionistic fuzzy sets Positive deal solution Pareto optimal solution

来源：评论

学校读者我要写书评

暂无评论

A neural network approach to multiobjective and multilevel programming problems

引用

COMPUTERS & MATHEMATICS WITH APPLICATIONS 2004年第1-2期48卷 95-108页

作者： Shih, HS Wen, UP Lee, ES Hsiao, HC Tamkang Univ Grad Inst Management Sci Taipei 251 Taiwan Natl Tsing Hua Univ Dept Ind Engn & Engn Management Hsinchu 300 Taiwan Kansas State Univ Dept Ind & Mfg Syst Engn Manhattan KS 66506 USA I Shou Univ Dept Ind Engn & Management Kaohsiung 840 Taiwan

This study aims at utilizing the dynamic behavior of artificial neural networks (ANNs) to solve multiobjective programming (MOP) and multilevel programming (MLP) problems. The traditional and nontraditional approaches to the MLP are first classified into five categories. Then, based on the approach proposed by Hopfield and Tank [1], the optimization problem is converted into a system of nonlinear differential equations through the use of an energy function and Lagrange multipliers. Finally, the procedure is extended to MOP and MLP problems. To solve the resulting differential equations, a steepest descent search technique is used. This proposed nontraditional algorithm is efficient for solving complex problems, and is especially useful for implementation on a large-scale VLSI, in which the MOP and MLP problems can be solved on a real time basis. To illustrate the approach, several numerical examples are solved and compared. (C) 2004 Elsevier Ltd. All rights reserved.

关键词： neural network energy function multilevel programming multiobjective programming dynamic behavior

来源：评论

学校读者我要写书评

暂无评论

BIOBJECTIVE OPTIMIZATION OVER THE EFFICIENT SET OF multiobjective INTEGER programming PROBLEM

引用

JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION 2021年第1期17卷 117-131页

作者： Cherfaoui, Yasmine Moula, Mustapha USTHB Dept Operat Res Bp 32 El Alia Algiers 16111 Algeria USTHB LaROMaD Lab Bp 32 El Alia Algiers 16111 Algeria

In this article, an exact method is proposed to optimize two preference functions over the efficient set of a multiobjective integer linear program (MOILP). This kind of problems arises whenever two associated decision-makers have to optimize their respective preference functions over many efficient solutions. For this purpose, we develop a branch-and-cut algorithm based on linear programming, for finding efficient solutions in terms of both preference functions and MOILP problem, without explicitly enumerating all efficient solutions of MOILP problem. The branch and bound process, strengthened by efficient cuts and tests, allows us to prune a large number of nodes in the tree to avoid many solutions. An illustrative example and an experimental study are reported.

关键词： multiobjective programming integer programming branch-and-cut

来源：评论

学校读者我要写书评

暂无评论

Optimality Conditions and Saddle-Point Theory for Nonsmooth Generalized Convexity multiobjective programming

Optimality Conditions and Saddle-Point Theory for Nonsmooth ...

引用

2009中国控制与决策会议

作者： Cailing Wang~1,Wenjuan Sun~2,You Zhang~3,Zhongfan Li~4 1.School of Mathematics,Jilin University,Changchun 130012,China 2.School of Science,Shenyang Ligong University,Shenyang 110168,China 3.School of Mathematics & Statistics,Northeast Normal University,Changchun 130024,China 4.School of Mathematics,Jilin University,Changchun 130012,China

In this paper,we introduce generalized essentially pseudoconvex function and generalized essentially quasiconvex function,and give sufficient optimality conditions of the nonsmooth generalized convex multi-objective p... 详细信息

关键词： multiobjective programming optimality conditions saddle point

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：