Results 41 to 50 of about 514 (86)
Nonconvex composite multiobjective nonsmooth fractional programming
Journal of Inequalities and Applications, 2013 We consider nonsmooth multiobjective programs where the objective function is a fractional composition of invex functions and locally Lipschitz and Gâteaux differentiable functions.
Ho Jung Kim, Do Sang Kim
semanticscholar +2 more sources
The Fastest Mixing Markov Process on a Graph and a Connection to a Maximum Variance Unfolding Problem [PDF]
, 2006 We consider a Markov process on a connected graph, with edges labeled with transition rates between the adjacent vertices. The distribution of the Markov process converges to the uniform distribution at a rate determined by the second smallest eigenvalue
Boyd, Stephen +3 more
core +2 more sources
Demonstratio MathematicaThis article concerns about optimality conditions for boundary-value problems related to differential inclusions (DFIs) of higher orders. We intend to attain optimality conditions when a general Lagrange functional takes place in the cost function ...
Yıldırım Uğur +2 more
doaj +1 more source
Partial Differential Equations in Applied MathematicsIn this paper, we present a Wolfe-type dual model containing the Caputo-Fabrizio fractional derivative, weak and strong duality results, number of Kuhn-Tucker type sufficient optimality conditions and duality results for variational problems (VPs) with ...
Ved Prakash Dubey +3 more
doaj +1 more source
ON NECESSARY CONDITIONS FOR EFFICIENCY IN DIRECTIONALLY DIFFERENTIABLE OPTIMIZATION PROBLEMS [PDF]
This paper deals with multiobjective programming problems with in- equality, equality and set constraints involving Dini or Hadamard differentiable func- tions.
Do Van Luu, Manh-Hung Nguyen
core +3 more sources
Strong duality in conic linear programming: facial reduction and extended duals
, 2013 The facial reduction algorithm of Borwein and Wolkowicz and the extended dual of Ramana provide a strong dual for the conic linear program $$ (P) \sup { | Ax \leq_K b} $$ in the absence of any constraint qualification.
A. Ben-Tal +24 more
core +1 more source
Geometric Duality for Convex Vector Optimization Problems [PDF]
, 2011 Geometric duality theory for multiple objective linear programming problems turned out to be very useful for the development of efficient algorithms to generate or approximate the whole set of nondominated points in the outcome space.
Heyde, Frank
core
The Computational Complexity of Duality
, 2016 We show that for any given norm ball or proper cone, weak membership in its dual ball or dual cone is polynomial-time reducible to weak membership in the given ball or cone.
Friedland, Shmuel, Lim, Lek-Heng
core +1 more source
Duality in nondifferentiable minimax fractional programming with
Journal of Inequalities and Applications, 2011 In this article, we are concerned with a nondifferentiable minimax fractional programming problem. We derive the sufficient condition for an optimal solution to the problem and then establish weak, strong, and strict converse duality theorems for the ...
Kailey N +3 more
doaj
On
Fixed Point Theory and Applications, 2011 A multiobjective fractional optimization problem (MFP), which consists of more than two fractional objective functions with convex numerator functions and convex denominator functions, finitely many convex constraint functions, and a geometric constraint
Kim Gwi, Lee Gue, Kim Moon
doaj