نتایج جستجو برای: fuzzy conic optimization problem

تعداد نتایج: 1176532  

Journal: :iranian journal of fuzzy systems 2013
b. farhadinia a. v. kamyad

the objective of this paper is to deal with the fuzzy conic program- ming problems. the aim here is to derive weak and strong duality theorems for a general fuzzy conic programming. toward this end, the convexity-like concept of fuzzy mappings is introduced and then a speci c ordering cone is established based on the parameterized representation of fuzzy numbers. un- der this setting, duality t...

The objective of this paper is to deal with the fuzzy conic program- ming problems. The aim here is to derive weak and strong duality theorems for a general fuzzy conic programming. Toward this end, The convexity-like concept of fuzzy mappings is introduced and then a speci c ordering cone is established based on the parameterized representation of fuzzy numbers. Un- der this setting, duality t...

2013
B. FARHADINIA A. V. Kamyad

The objective of this paper is to deal with the fuzzy conic programming problems. The aim here is to derive weak and strong duality theorems for a general fuzzy conic programming. Toward this end, The convexity-like concept of fuzzy mappings is introduced and then a specific ordering cone is established based on the parameterized representation of fuzzy numbers. Under this setting, duality theo...

پایان نامه :دانشگاه آزاد اسلامی - دانشگاه آزاد اسلامی واحد تهران مرکزی - دانشکده برق و الکترونیک 1390

there are many approaches for solving variety combinatorial optimization problems (np-compelete) that devided to exact solutions and approximate solutions. exact methods can only be used for very small size instances due to their expontional search space. for real-world problems, we have to employ approximate methods such as evolutionary algorithms (eas) that find a near-optimal solution in a r...

In this paper, we present a trust region method for unconstrained optimization problems with locally Lipschitz functions. For this idea, at first, a smoothing conic model sub-problem is introduced for the objective function, by the approximation of steepest descent method. Next, for solving the conic sub-problem, we presented the modified convenient curvilinear search method and equipped it wit...

Journal: :Math. Oper. Res. 2014
Boris S. Mordukhovich T. T. A. Nghia

The paper is devoted to the study of general nonsmooth problems of cone-constrained optimization (or conic programming) important for various aspects of optimization theory and applications. Based on advanced constructions and techniques of variational analysis and generalized differentiation, we derive new necessary optimality conditions (in both " exact " and " fuzzy " forms) for nonsmooth co...

Journal: :international journal of industrial engineering and productional research- 0
m. reza peyghami - abdollah aghaie - hadi mokhtari -

in this paper, we consider a stochastic time-cost tradeoff problem (tctp) in pert networks for project management, in which all activities are subjected to a linear cost function and assumed to be exponentially distributed. the aim of this problem is to maximize the project completion probability with a pre-known deadline to a predefined probability such that the required additional cost is min...

صلاحی, مازیار, طاعتی, اکرم,

Trust region subproblem (TRS), which is the problem of minimizing a quadratic function over a ball, plays a key role in solving unconstrained nonlinear optimization problems. Though TRS is not necessarily convex, there are efficient algorithms to solve it, particularly in large scale. Recently, extensions of TRS with extra linear constraints have received attention of several researchers. It ha...

2003
François Glineur

The purpose of this survey article is to introduce the reader to a very elegant formulation of convex optimization problems called conic optimization and outline its many advantages. After a brief introduction to convex optimization, the notion of convex cone is introduced, which leads to the conic formulation of convex optimization problems. This formulation features a very symmetric dual prob...

2018
ALPER ATAMTÜRK

We describe strong convex valid inequalities for conic quadratic mixed 0-1 optimization. The inequalities exploit the submodularity of the binary restrictions and are based on the polymatroid inequalities over binaries for the diagonal case. We prove that the convex inequalities completely describe the convex hull of a single conic quadratic constraint as well as the rotated cone constraint ove...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید