نتایج جستجو برای: Quasi linear programming method
تعداد نتایج: 2294082 فیلتر نتایج به سال:
in this thesis, using concepts of wavelets theory some methods of the solving optimal control problems (ocps). governed by time-delay systems is investigated. this thesis contains two parts. first, the method of obtaining of the ocps in time delay systems by linear legendre multiwavelets is presented. the main advantage of the meth...
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...
abstract this thesis includes five chapter : the first chapter assign to establish fuzzy mathematics requirement and introduction of liner programming in thesis. the second chapter we introduce a multilevel linear programming problems. the third chapter we proposed interactive fuzzy programming which consists of two phases , the study termination conditions of algorithm we show a satisfac...
abstract objectives gradual increase length and complexity of utterance (gilcu) therapy method is a form of operant conditioning. this type of treatment is very precise and controlled that is done in 54 steps in 3 speech situations consisted of monologue, reading and conversation. this study aimed to examine the effects of gilcu treatment method on reduction of speech dysfluency of school-age...
Rubin and Narsimhan [1984] proposed a method for formulating fuzzy priorities in goal programming. They used the concept that the membership function based on nested priorities has to be concave to solve the fuzzy goal programming problem by linear programming method. In this paper, we relax the condition of concave membership function by quasi concave membership function. We showed that the fu...
This paper proposes a method based on linear programming techniques to treat quasi-concave and non-concave fuzzy multi-objective programming (FMOP) problems. The proposed method initially presents a piecewise linear expression to interpreting a quasi-concave membership function. Then we 7nd the convex-type break points and transform all quasiconcave membership functions into concave functions. ...
artificial neural networks have the advantages such as learning, adaptation, fault-tolerance, parallelism and generalization. this paper is a scrutiny on the application of diverse learning methods in speed of convergence in neural networks. for this aim, first we introduce a perceptron method based on artificial neural networks which has been applied for solving a non-singula...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید