Showing 1 - 10 of 1,113
objective space cut and bound algorithm for approximately solving convex multiplicative programming problems. This method is … based on an objective space approximation algorithm for convex multi-objective programming problems. We show that this multi …-objective optimisation algorithm can be changed into a cut and bound algorithm to solve convex multiplicative programming problems. We use an …
Persistent link: https://www.econbiz.de/10010896433
nondominated points and exclude the regions that are dominated by the previously-generated nondominated points. One algorithm … generates new points by solving models with additional binary variables and constraints. The other algorithm employs a search …
Persistent link: https://www.econbiz.de/10010994053
In this work, we consider a new class of multitime multiobjective variational problems of minimizing a vector of functionals of curvilinear integral type. Based on the normal efficiency conditions for multitime multiobjective variational problems, we study duals of Mond-Weir type, generalized...
Persistent link: https://www.econbiz.de/10010994003
In this work we study the Newton-like methods for finding efficient solutions of the vector optimization problem for a map from a finite dimensional Hilbert space X to a Banach space Y, with respect to the partial order induced by a closed, convex and pointed cone C with a nonempty interior. We...
Persistent link: https://www.econbiz.de/10010998354
A nonsmooth multiobjective optimization problem involving generalized (F, α, ρ, d)-type I function is considered. Karush–Kuhn–Tucker type necessary and sufficient optimality conditions are obtained for a feasible point to be an efficient or properly efficient solution. Duality results are...
Persistent link: https://www.econbiz.de/10010999649
A nonsmooth multiobjective optimization problem involving generalized (F, α, ρ, d)-type I function is considered. Karush–Kuhn–Tucker type necessary and sufficient optimality conditions are obtained for a feasible point to be an efficient or properly efficient solution. Duality results are...
Persistent link: https://www.econbiz.de/10010847603
In this paper the interval valued function is defined in the parametric form and its properties are studied. A methodology is developed to study the existence of the solution of a general interval optimization problem, which is expressed in terms of the interval valued functions. The methodology...
Persistent link: https://www.econbiz.de/10010950195
design the model efficiently, a three-phase algorithm for finding all efficient solutions is developed, where the first two …
Persistent link: https://www.econbiz.de/10009291906
Purpose – The paper's aim is to study the system of interest, its crippling of the market by monetary manipulation and creation of gross disparity and its consequences and to explore an efficient Islamic alternative. Design/methodology/approach – The application of science and its analytical...
Persistent link: https://www.econbiz.de/10009319830
The paper deals with a stability of multiobjective stochastic programming problems in which objective functions are in the form of mathematical expectation of functions depending on a random element and a constraints set is deterministic. The stability is investigated with respect to a...
Persistent link: https://www.econbiz.de/10008528818