Postoptimal analysis of one lexicographic combinatorial problem with non-linear criteria
نویسندگان
چکیده
In this article we consider a multicriteria combinatorial problem with ordered MINMIN criteria. We obtain necessary and sufficient conditions of that type of stability to the initial data perturbations for which all lexicographic optima of the original problem are preserved and occurrence of the new ones is allowed. Mathematics subject classification: 90C27, 90C29, 90C31
منابع مشابه
Lexicographic goal programming approach for portfolio optimization
This paper will investigate the optimum portfolio for an investor, taking into account 5 criteria. The mean variance model of portfolio optimization that was introduced by Markowitz includes two objective functions; these two criteria, risk and return do not encompass all of the information about investment; information like annual dividends, S&P star ranking and return in later years which is ...
متن کاملStability Analysis for a Multicriteria Problem with Linear Criteria and Parameterized Principle of Optimality “from Lexicographic to Slater“
A multicriteria linear programming problem with integer variables and parameterized optimality principle ”from lexicographic to Slater” is considered. A situation in which initial coefficients of penalty cost functions are not fixed but may be potentially a subject to variations is studied. For any efficient solution, appropriate measures of the quality are introduced which incorporate informat...
متن کاملA revisit of a mathematical model for solving fully fuzzy linear programming problem with trapezoidal fuzzy numbers
In this paper fully fuzzy linear programming (FFLP) problem with both equality and inequality constraints is considered where all the parameters and decision variables are represented by non-negative trapezoidal fuzzy numbers. According to the current approach, the FFLP problem with equality constraints first is converted into a multi–objective linear programming (MOLP) problem with crisp const...
متن کاملSolving matrix games with hesitant fuzzy pay-offs
The objective of this paper is to develop matrix games with pay-offs of triangular hesitant fuzzy elements (THFEs). To solve such games, a new methodology has been derived based on the notion of weighted average operator and score function of THFEs. Firstly, we formulate two non-linear programming problems with THFEs. Then applying the score function of THFEs, we transform these two problems in...
متن کاملAn interior point approach to postoptimal and parametric analysis in linear programming
In practice, understanding the behavior of the solution of the linear programming problem due to changes in the data is often as important as obtaining the optimal solution itself. Postoptimal analysis based on the simplex method by using an optimal basis is well established and widely used. However, in case of degenerate optimal solutions, due to nonunicity of optimal bases, problems arise in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- The Computer Science Journal of Moldova
دوره 17 شماره
صفحات -
تاریخ انتشار 2009