نتایج جستجو برای: one nonlinear programming
تعداد نتایج: 2422208 فیلتر نتایج به سال:
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...
the problem of lot sizing, sequencing and scheduling multiple products in flow line production systems has been studied by several authors. almost all of the researches in this area assumed that setup times and costs are sequence –independent even though sequence dependent setups are common in practice. in this paper we present a new mixed integer non linear program (minlp) and a heuristic meth...
in this paper, we deal to obtain some new complexity results for solving semidefinite optimization (sdo) problem by interior-point methods (ipms). we define a new proximity function for the sdo by a new kernel function. furthermore we formulate an algorithm for a primal dual interior-point method (ipm) for the sdo by using the proximity function and give its complexity analysis, and then we sho...
in this paper, the portfolio selection problem is considered, where fuzziness and randomness appear simultaneously in optimization process. since return and dividend play an important role in such problems, a new model is developed in a mixed environment by incorporating fuzzy random variable as multi-objective nonlinear model. then a novel interactive approach is proposed to determine the pref...
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...
one of the difficulties of data envelopment analysis(dea) is the problem of deciency discriminationamong efficient decision making units(dmus) and hence, yielding large number of dmus as efficientones. the main purpose of this paper is to overcome this inability. one of the methods for rankingefficient dmus is minimizing the coefficient of variation (cv) for inputs-outputs weights. in this pap...
abstract it is the purpose of this article to introduce a linear approximation technique for solving a fractional chance constrained programming (cc) problem. for this purpose, a fuzzy goal programming model of the equivalent deterministic form of the fractional chance constrained programming is provided and then the process of defuzzification and linearization of the problem is started. a samp...
چکیده ندارد.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید