Efficiency and generalized convex duality for nondifferentiable multiobjective programs.
Efficiency conditions for multiobjective fractional variational problems.
Efficiency in terms of Lagrangian.
Efficient and local efficient solutions for assignment type problems
In this paper, we analyse the multiobjective problem generated by applying a goal programming approach to deal with linear assignment type problem. We specify sufficient conditions for a solution to be efficient for this problem. The notion of efficiency with respect to a neighborhood is also introduced and characterized through sufficient conditions. Unfortunately, these conditions are not necessary in general.
Efficient and Local Efficient Solutions for Assignment Type Problems
In this paper, we analyse the multiobjective problem generated by applying a goal programming approach to deal with linear assignment type problem. We specify sufficient conditions for a solution to be efficient for this problem. The notion of efficiency with respect to a neighborhood is also introduced and characterized through sufficient conditions. Unfortunately, these conditions are not necessary in general.
El conjunto eficiente en problemas de localización con normas mixtas (Lp).
En el presente trabajo establecemos una nueva aproximación a la solución del problema de localización con normas mixtas a través de las direcciones de proyección.Probamos que el cierre octogonal de los puntos de demanda es una buena aproximación para el conjunto de puntos eficientes cuando el problema está formulado como un problema multiobjetivo con normas mixtas tipo lp. Demostramos que esta cota es alcanzable, dando condiciones para que ello ocurra, lo que es de gran importancia para el caso...
Enumerating the Set of Non-dominated Vectors in Multiple Objective Integer Linear Programming
An algorithm for enumerating all nondominated vectors of multiple objective integer linear programs is presented. The method tests different regions where candidates can be found using an auxiliary binary problem for tracking the regions already explored. An experimental comparision with our previous efforts shows the method has relatively good time performance.
Exact l penalty function for nonsmooth multiobjective interval-valued problems
Our objective in this article is to explore the idea of an unconstrained problem using the exact l penalty function for the nonsmooth multiobjective interval-valued problem (MIVP) having inequality and equality constraints. First of all, we figure out the KKT-type optimality conditions for the problem (MIVP). Next, we establish the equivalence between the set of weak LU-efficient solutions to the problem (MIVP) and the penalized problem (MIVP) with the exact l penalty function. The utility of...
Existence of minimizers and necessary conditions in set-valued optimization with equilibrium constraints
In this paper we study set-valued optimization problems with equilibrium constraints (SOPECs) described by parametric generalized equations in the form where both and are set-valued mappings between infinite-dimensional spaces. Such models particularly arise from certain optimization-related problems governed by set-valued variational inequalities and first-order optimality conditions in nondifferentiable programming. We establish general results on the existence of optimal solutions under...
Experimental evaluation of a multiobjective linear programming software
Extended VIKOR as a new method for solving Multiple Objective Large-Scale Nonlinear Programming problems
The VIKOR method was introduced as a Multi-Attribute Decision Making (MADM) method to solve discrete decision-making problems with incommensurable and conflicting criteria. This method focuses on ranking and selecting from a set of alternatives based on the particular measure of “closeness” to the “ideal” solution. The multi-criteria measure for compromise ranking is developed from the l–p metric used as an aggregating function in a compromise programming method. In this paper, the VIKOR method...
Fritz John's type conditions and associated duality forms in convex non differentiable vector-optimization
From scalar to vector optimization
Initially, second-order necessary optimality conditions and sufficient optimality conditions in terms of Hadamard type derivatives for the unconstrained scalar optimization problem , , are given. These conditions work with arbitrary functions , but they show inconsistency with the classical derivatives. This is a base to pose the question whether the formulated optimality conditions remain true when the “inconsistent” Hadamard derivatives are replaced with the “consistent” Dini derivatives. It...
Generalization of the Zionts-Wallenius algorithm
Generalized -univex -set functions and semiparametric duality models in multiobjective fractional subset programming.
Generalized -univex -set functions and global semiparametric sufficient efficiency conditions in multiobjective fractional subset programming.
Hard and fuzzy classification within the framework of hierarchical and optimization clustering
Heuristic solving a bicriteria parallel-machine scheduling problem
Hybrid method for a class of stochastic bi-criteria optimization problems.
Interactive compromise hypersphere method and its applications
The paper focuses on multi-criteria problems. It presents the interactive compromise hypersphere method with sensitivity analysis as a decision tool in multi-objective programming problems. The method is based on finding a hypersphere (in the criteria space) which is closest to the set of chosen nondominated solutions. The proposed modifications of the compromise hypersphere method are based on using various metrics and analyzing their influence on the original method. Applications of the proposed...