نتایج جستجو برای: Optimal solution

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

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه بوعلی سینا - دانشکده علوم پایه 1391

abstract: in this thesis, we focus to class of convex optimization problem whose objective function is given as a linear function and a convex function of a linear transformation of the decision variables and whose feasible region is a polytope. we show that there exists an optimal solution to this class of problems on a face of the constraint polytope of feasible region. based on this, we dev...

پایان نامه :دانشگاه آزاد اسلامی - دانشگاه آزاد اسلامی واحد تهران مرکزی - دانشکده برق و الکترونیک 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...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه علوم پایه دامغان 1389

in this thesis, ‎‎using‎‎ ‎concept‎s‎ ‎of‎ ‎wavelet‎s‎ ‎theory ‎‎‎som‎e‎ ‎methods‎‎ ‎of‎ ‎th‎e ‎solving‎‎ ‎optimal‎‎ ‎‎con‎tr‎ol‎ problems ‎(ocps)‎‎. ‎g‎overned by time-delay systems is investigated. ‎th‎is‎ thesis contains ‎tw‎o parts. ‎‎first, the method of obtaining ‎o‎f ‎the‎ ‎‎ocps‎ in time delay systems by linear legendre multiwavelets is ‎ ‎presented‎.‎‎‎‎ the main advantage of the meth...

پایان نامه :0 1391

uncertainty in the financial market will be driven by underlying brownian motions, while the assets are assumed to be general stochastic processes adapted to the filtration of the brownian motions. the goal of this study is to calculate the accumulated wealth in order to optimize the expected terminal value using a suitable utility function. this thesis introduced the lim-wong’s benchmark fun...

Journal: :ژورنال بین المللی پژوهش عملیاتی 0
n. safaei m. saraj

in this paper, a new method is proposed to find the fuzzy optimal solution of fully fuzzy linear bilevel programming (fflblp) problems by representing all the parameters as triangular fuzzy numbers. in the proposed method, the given fflblp problem is decomposed into three crisp linear programming (clp) problems with bounded variables constraints, the three clp problems are solved separately and...

Journal: :SIAM J. Financial Math. 2013
Etienne Chevalier Vathana Ly Vath Simone Scotti

This paper concerns with the problem of determining an optimal control on the dividend and investment policy of a firm. We allow the company to make an investment by increasing its outstanding indebtedness, which would impact its capital structure and risk profile, thus resulting in higher interest rate debts. We formulate this problem as a mixed singular and switching control problem and use a...

In this paper, we propose the new concept of optimal solution for fuzzy variational problems based on the possibility and necessity measures. Inspired by the well–known embedding theorem, we can transform the fuzzy variational problem into a bi–objective variational problem. Then the optimal solutions of fuzzy variational problem can be obtained by solving its corresponding biobjective variatio...

Journal: :journal of computer and robotics 0
ahmad fakharian tarbiat modares mohammad taghi hamidi beheshti tarbiat modares

first riccati equation with matrix variable coefficients, arising in optimal and robust control approach, is considered. an analytical approximation of the solution of nonlinear differential riccati equation is investigated using the adomian decomposition method. an application in optimal control is presented. the solution in different order of approximations and different methods of approximat...

Journal: :journal of algorithms and computation 0
s. jabari university of tehran, department of algorithms and computation. dara moazzami university of tehran, college of engineering, faculty of engineering science a. ghodousian university of tehran, college of engineering, faculty of engineering science

in this paper, we study the generalized bin covering problem. for this problem an exact algorithm is introduced which can nd optimal solution for small scale instances. to nd a solution near optimal for large scale instances, a heuristic algorithm has been proposed. by computational experiments, the eciency of the heuristic algorithm is assessed.

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

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