Search Results - subject:"efficient solution"

Fuzzy Multi-Objective Linear Programming Based on Compromise VIKOR Method

Hajiagha, Seyed Hossein Razavi; Mahdiraji, Hannan Amoozad; … - In: International Journal of Information Technology & … 13 (2014) 04, pp. 679-698

proposed method tries to find fuzzy efficient solution for a problem by minimizing its combinational distance from an ideal and …

Persistent link: https://www.econbiz.de/10010801033

Newton-like methods for efficient solutions in vector optimization

Chuong, Thai - In: Computational Optimization and Applications 54 (2013) 3, pp. 495-516

our method converges to an efficient solution of this problem. Copyright Springer Science+Business Media, LLC 2013 …

Persistent link: https://www.econbiz.de/10010998354

On efficient applications of G-Karush-Kuhn-Tucker necessary optimality theorems to multiobjective programming problems

Kim, Moon; Lee, Gue - In: Journal of Global Optimization 55 (2013) 1, pp. 5-11

We prove a slightly modified G-Karush-Kuhn-Tucker necessary optimality theorem for multiobjective programming problems, which was originally given by Antczak (J Glob Optim 43:97–109, <CitationRef CitationID="CR2">2009</CitationRef>), and give an example showing the efficient application of (modified) G-Karush-Kuhn-Tucker optimality...</citationref>

Persistent link: https://www.econbiz.de/10010994180

Necessary optimality conditions for a set-valued fractional extremal programming problem under inclusion constraints

Gadhi, N.; Jawhar, A. - In: Journal of Global Optimization 56 (2013) 2, pp. 489-501

In this paper, we are concerned with a set-valued fractional extremal programming problem under inclusion constraints. Our approach consists of using the extremal principle (an approach initiated by Mordukhovich, which does not involve any convex approximations and convex separation arguments)...

Persistent link: https://www.econbiz.de/10010896408

Characterizations of the nonemptiness and compactness for solution sets of convex set-valued optimization problems

Huang, X.; Yao, J. - In: Journal of Global Optimization 55 (2013) 3, pp. 611-626

compactness for the weakly efficient solution set of a convex vector set-valued optimization problem (with or without cone … and the decision space is finite-dimensional. We establish that the nonemptiness and compactness for the weakly efficient … solution set of a convex vector set-valued optimization problem (with or without cone constraints) can be exactly characterized …

Persistent link: https://www.econbiz.de/10010634263

Maximal and supremal tolerances in multiobjective linear programming

Hladík, Milan; Sitarz, Sebastian - In: European Journal of Operational Research 228 (2013) 1, pp. 93-101

Let a multiobjective linear programming problem and any efficient solution be given. Tolerance analysis aims to compute … interval tolerances for (possibly all) objective function coefficients such that the efficient solution remains efficient for …

Persistent link: https://www.econbiz.de/10011052422

An L1-norm method for generating all of efficient solutions of multi-objective integer linear programming problem

Tohidi, Ghasem; Razavyan, Shabnam - In: Journal of industrial engineering international 8 (2012), pp. 1-8

the number of efficient solution is finite, the proposed method finds all of them without generating all feasible … solutions of MOILP or concluding that there is no efficient solution. In any iteration of the proposed algorithm, a single …

Persistent link: https://www.econbiz.de/10009758841

Duality theorems for a new class of multitime multiobjective variational problems

Pitea, Ariana; Postolache, Mihai - In: Journal of Global Optimization 54 (2012) 1, pp. 47-58

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

Efficient solution of interval optimization problem

Bhurjee, A.; Panda, G. - In: Computational Statistics 76 (2012) 3, pp. 273-288

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/10010759399

Efficient solution of interval optimization problem

Bhurjee, A.; Panda, G. - In: Mathematical Methods of Operations Research 76 (2012) 3, pp. 273-288

Persistent link: https://www.econbiz.de/10010950195