We obtain sufficient and/or necessary conditions for global/local error bounds for the distances to some sets appeared in set optimization studied with both the set approach and vector approach (sublevel sets, constraint sets, sets of all Pareto efficient/ Henig proper efficient/super efficient solutions, sets of solutions corresponding to one Pareto efficient/Henig proper efficient/super effic...

this study investigated the feasibility of using different extracting solutions at various concentrations to remove copper from low permeability silty loam soils, which have a high buffering soil, ph of 7.6, where it spiked with copper at concentration of about 1500 mg/kg to represent soil conditions. the most efficient extracting solutions could be used as purging/extracting solutions in other...

A multiobjective nonlinear programming problem is considered. Sufficiency theorems are derived for efficient and properly efficient solutions under generalized (F, ρ)-convexity assumptions. Weak, strong and strict converse duality theorems are established for a general Mond–Weir type dual relating properly efficient solutions of the primal and dual problems.

mobile ad hoc networks (manet) are constructed by mobile nodes without access point. since manet has certain constraints, including power shortages, an unstable wireless environment and node mobility, more power-efficient and reliable routing protocols are needed. the olsr protocol is an optimization of the classical link state algorithm. olsr introduces an interesting concept, the multipoint r...

oxime extractants 3-tert-butyl-2-hydroxy-5-methyl benzaldehyde oxime (hl1) and 3-tert-butyl-2-hydroxy-5-methoxy benzaldehyde oxime (hl2) were synthesized and characterized by conventional spectroscopic methods. suitable lipophilic nature of the prepared extractants allowed examining the ability of these molecules for extraction-separation of copper from its mixture with normally associated meta...

The connections between variational inequalities and optimization problems is well known, and many investigators have discussed them along many years; see, for instance, [1, 8, 10, 13]. This last article, which was authored by Giannessi, in particular, is one of the main works that study these connections in the finite-dimensional context. In recent years, the interest in the investigation on t...

In this work, we deal with obtaining efficient solutions for stochastic multiobjective programming problems. In general, these solutions are obtained in two stages: in one of them, the stochastic problem is transformed into its equivalent deterministic problem, and in the other one, some of the existing generating techniques in multiobjective programming are applied to obtain efficient solution...

According to the most widely accepted classification the Multiobjective Mathematical Programming (MMP) methods can be classified as a priori, interactive and a posteriori, according to the decision stage in which the decision maker expresses his/her preferences. Although the a priori methods are the most popular, the interactive and the a-posteriori methods convey much more information to the d...