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

An approach for finding efficient points in multiobjective linear programming

JOURNAL OF INFORMATION & OPTIMIZATION SCIENCES 2008年第2期29卷 203-216页

作者： Pieume, C. O. Fotso, L. P. Siarry, P. Univ Yaounde I Fac Sci Dept Math POB 812 Yaounde Cameroon Univ Yaounde I Fac Sci Dept Comp Sci Yaounde Cameroon Univ Paris XII Fac Sci & Technol LISSI F-94010 Creteil France

This paper presents a complete procedure for solving Multiple Objective linear programming Problems. The approach generates the whole efficient set and all extreme efficient points. The algorithm is based on a new characterization of efficient face incident to a given extreme point and the connectedness property of the set of ideal tableaux associated to a degenerated point to handle degenerated problems. A numerical example is given to illustrate the proposed algorithm.

关键词： Efficient point efficient face multiobjective linear programming

来源：评论

学校读者我要写书评

暂无评论

Interactive multiobjective fuzzy random linear programming: Maximization of possibility and probability

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2008年第2期188卷 530-539页

作者： Katagiri, Hideki Sakawa, Masatoshi Kato, Kosuke Nishizaki, Ichiro Hiroshima Univ Grad Sch Engn Hiroshima 7398527 Japan

This paper considers multiobjective linear programming problems with fuzzy random variables coefficients. A new decision making model is proposed to maximize both possibility and probability, which is based on possibilistic programming and stochastic programming. An interactive algorithm is constructed to obtain a satisficing solution satisfying at least weak Pareto optimality. (c) 2007 Elsevier B.V. All rights reserved.

关键词： fuzzy random variable multiobjective linear programming probability maximization model stochastic programming possibilistic programming interactive algorithm

来源：评论

学校读者我要写书评

暂无评论

multiobjective optimal control through linear programming with interval objective function

Multiobjective optimal control through linear programming wi...

引用

36th Annual International Conference of the Society-of-Instrument-and-Control-Engineers (SICE 97)

作者： Ida, M Kyoto Univ Kyoto Japan

In this paper we consider multiobjective linear programming problem with interval objective functions. One solution for this problem is called a necessarily efficient solution. We improve the extended multiobjective simplex method for generating a set of necessarily efficient solutions of multiobjective linear optimal control problems.

关键词： multiobjective linear programming optimal control interval coefficient necessarily efficient solution extended multiobjective simplex method

来源：评论

学校读者我要写书评

暂无评论

Interactive multiobjective fuzzy random programming through the level set-based probability model

引用

INFORMATION SCIENCES 2011年第9期181卷 1641-1650页

作者： Katagiri, Hideki Sakawa, Masatoshi Hiroshima Univ Grad Sch Engn Hiroshima 7398527 Japan

This paper considers a multiobjective linear programming problem involving fuzzy random variable coefficients. A new fuzzy random programming model is proposed by extending the ideas of level set-based optimality and a stochastic programming model. The original problem involving fuzzy random variables is transformed into a deterministic equivalent problem through the proposed model. An interactive algorithm is provided to obtain a satisficing solution for a decision maker from among a set of newly defined Pareto optimal solutions. It is shown that an optimal solution of the problem to be solved iteratively in the interactive algorithm is analytically obtained by a combination of the bisection method and the simplex method. (C) 2011 Published by Elsevier Inc.

关键词： Fuzzy random variable multiobjective linear programming Level set-based model Pareto optimality Probability maximization Interactive algorithm

来源：评论

学校读者我要写书评

暂无评论

Efficient curve fitting: An application of multiobjective programming

引用

APPLIED MATHEMATICAL MODELLING 2011年第1期35卷 346-365页

作者： Pourkarimi, L. Yaghoobi, M. A. Mashinchi, M. Shahid Bahonar Univ Kerman Dept Math Fac Math & Comp Sci Kerman Iran Shahid Bahonar Univ Kerman Dept Stat Fac Math & Comp Sci Kerman Iran

Curve fitting is an interesting and important subject in mathematics and engineering. It has been studied extensively and a number of approaches, mostly based on polynomials and piecewise polynomials, have been employed. In the usual setting, some data points are given and one wants to find a polynomial function with the minimum violations measured by a norm in the given data points. In these approaches, norms are applied to aggregate all violations as a scalar. In this paper, the polynomial curve fitting problem is considered from the viewpoint of decision making. Taking into account some weaknesses of the norm-based approaches, a multiobjective programming model for curve fitting is given in which the violations are minimized simultaneously as a vector. This approach is more flexible for the curve fitting problem. Indeed, using the concept of efficiency in multiobjective programming, it enables us to impose some additional helpful secondary preferences. Especially, this approach can obtain a fitted curve with efficient violations and minimum average curvature or minimum average slope. (C) 2010 Elsevier Inc. All rights reserved.

关键词： multiobjective linear programming Maximal efficient face Efficiency Curve fitting Smoothness

来源：评论

学校读者我要写书评

暂无评论

Constructing efficient solutions structure of multio ective linear programming

引用

JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS 2005年第2期307卷 504-523页

作者： Yan, H Wei, QL Wang, J Hong Kong Polytech Univ Dept Logist Hong Kong Hong Kong Peoples R China

It is not a difficult task to find a weak Pareto or Pareto solution in a multiobjective linear programming (MOLP) problem. The difficulty lies in finding all these solutions and representing their structure. This paper develops an algorithm for solving this problem. We investigate the solutions and their relationships in the objective space. The algorithm determines finite number of weights, each of which corresponds to a weighted sum problems. By solving these problems, we further obtain all weak Pareto and Pareto solutions of the MOLP and their structure in the constraint space. The algorithm avoids the degeneration problem, which is a major hurdle of previous works, and presents an easy and clear solution structure. (c) 2004 Published by Elsevier Inc.

关键词： multiobjective linear programming efficient solutions set solution structure

来源：评论

学校读者我要写书评

暂无评论

A branch and cut algorithm to optimize a weighted sum-of-ratios in multiobjective mixed-integer fractional programming

引用

OR SPECTRUM 2024年 1-29页

作者： Costa, Joao Paulo Alves, Maria Joao Univ Coimbra Fac Econ CeBER Av Dias Silva 165 P-3004512 Coimbra Portugal INESC Coimbra Coimbra Portugal

multiobjective linear fractional programming is useful to model multiobjective problems where all or some of the objective functions are a ratio or proportion of one linear/affine function to another linear/affine function. In practice, many of such problems include integer variables. If the weighted-sum scalarization is used to compute efficient solutions to the multiobjective problem, then the scalar problem to be solved for each weight vector turns out to be a weighted sum-of-ratios. There are several algorithms reported in the literature to optimize weighted sum-of-ratios, but almost all of them cannot deal with integer variables. In this paper we propose a Branch & Cut algorithm to optimize weighted-sums of the objective functions in multiobjective mixed integer fractional programming (MOMIFP). Several theoretical properties that support the algorithm are presented and proved. Computational experiments with randomly generated general problems are presented and discussed, which show that the algorithm is able to deal with practical MOMIFP problems.

关键词： Fractional programming multiobjective linear programming Mixed integer programming Branch & Cut algorithm Weighted sum-of-ratios

来源：评论

学校读者我要写书评

暂无评论

Interactive fuzzy random multiobjective programming based on M-α-Pareto optimality and stochastic programming models

Interactive fuzzy random multiobjective programming based on...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Katagiri, H Sakawa, M Kato, K Nishizaki, I Danjyo, H Hiroshima Univ Grad Sch Engn Higashihiroshima 7398527 Japan

ISBN: (纸本)0780392981

This paper deals with multiobjective linear programming problems involving fuzzy random variable coefficients and provides new solution concepts based on M alpha-Pareto optimality and stochastic programming models. Fuzzy goals are introduced to consider the imprecise of the decision maker's judgment for objective functions. After the formulated problem is transformed into the deterministic one, an interactive algorithm based on the reference point method is constructed to solve the deterministic problem.

关键词： fuzzy random variable multiobjective linear programming M-alpha-Pareto optimality stochastic programming model interactive decision making

来源：评论

学校读者我要写书评

暂无评论

Interactive multiobjective Random Fuzzy programming: Necessity-Based Value at Risk Model

Interactive Multiobjective Random Fuzzy Programming: Necessi...

引用

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

作者： Katagiri, Hideki Uno, Takeshi Kato, Kosuke Tsuda, Hiroshi Tsubaki, Hiroe 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 Doshisya Univ Fac Sci & Engn Kyoto 6100394 Japan Inst Stat Math Tachikawa Tokyo 1908562 Japan

ISBN: (纸本)9781467317146

This article considers multiobjective linear programming problems (MOLPP) where random fuzzy variables are contained in objective functions and constraints. The purpose of the proposed decision making model is to optimize values at risk under the constraints using a necessity measure. An interacitve algorithm is constructed in order to obtain a satisficing solution for the decision maker from among a set of Pareto optimal solutions.

关键词： multiobjective linear programming random fuzzy variable necessity value at risk Pareto optimal solutions interactive algorithm

来源：评论

学校读者我要写书评

暂无评论

Using modified maximum regret for finding a necessarily efficient solution in an interval MOLP problem

引用

FUZZY OPTIMIZATION AND DECISION MAKING 2016年第3期15卷 237-253页

作者： Rivaz, S. Yaghoobi, M. A. Hladik, M. Univ Yasuj Dept Math Yasuj Iran Shahid Bahonar Univ Kerman Fac Math & Comp Dept Appl Math Kerman Iran Charles Univ Prague Fac Math & Phys Dept Appl Math Malostranske Nam 25 Prague 11800 Czech Republic

The current research concerns multiobjective linear programming problems with interval objective functions coefficients. It is known that the most credible solutions to these problems are necessarily efficient ones. To solve the problems, this paper attempts to propose a new model with interesting properties by considering the minimax regret criterion. The most important property of the new model is attaining a necessarily efficient solution as an optimal one whenever the set of necessarily efficient solutions is nonempty. In order to obtain an optimal solution of the new model, an algorithm is suggested. To show the performance of the proposed algorithm, numerical examples are given. Finally, some special cases are considered and their characteristic features are highlighted.

关键词： multiobjective linear programming Interval programming Minimax regret criterion Necessarily efficient solutions

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：