نتایج جستجو برای: strong feasible basis
تعداد نتایج: 816093 فیلتر نتایج به سال:
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...
Introduction: Radiotherapy (RT) plan evaluation using dose response models has become a feasible approach in routine clinical practice. Although there are several tools for this task, they suffer from limitations including number of different dose response models and parameters. In the present study, we aimed to develop a free program for RT plan evaluation based on a variety ...
For learning problem of Radial Basis Function Process Neural Network (RBF-PNN), an optimization training method based on GA combined with SA is proposed in this paper. Through building generalized Fréchet distance to measure similarity between time-varying function samples, the learning problem of radial basis centre functions and connection weights is converted into the training on correspondi...
In this paper, a chaos search immune algorithm (CSIA) is proposed by integrating the chaos optimization algorithm and the clonal selection algorithm. First, optimization variables are expressed by chaotic variables through solution space transformation. Then, taking advantages of the ergodic and stochastic properties of chaotic variables, a chaos search is performed in the neighbourhoods of hig...
This paper presents the formulation and solution of the Combinatorial Multi-Mode Resource Constrained Multi-Project Scheduling Problem. The focus of the proposed method is not on finding a single optimal solution, instead on presenting multiple feasible solutions, with cost and duration information to the project manager. The motivation for developing such an approach is due in part to practica...
This paper surveys the origins and implications of ( nite) criss-cross methods in linear programming and related problems. Most pivot algorithms, like Dantzig's celebrated Simplex method, need a feasible basis to start with; when the basis is changed, feasibility is preserved until optimality or unboundedness is detected. To obtain a feasible basis a so-called rst phase problem must be solved. ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید