نتایج جستجو برای: convex semi infinite programming
تعداد نتایج: 567949 فیلتر نتایج به سال:
With a common background and motivation, the main contributions of this paper are developed in two different directions. Firstly, we are concerned with functions, which are the maximum of a finite amount of continuously differentiable functions of n real variables, paying special attention to the case of polyhedral functions. For these max-functions, we obtain some results about outer limits of...
In this paper, we study a class of fractional semi-infinite polynomial programming (FSIPP) problems, in which the objective is fraction convex and concave polynomial, constraints consist infinitely many inequalities. To solve such problem, first reformulate it to pair primal dual conic optimization reduce semidefinite (SDP) problems if can bring sum-of-squares structures into constraints. end, ...
This paper describes a general numerical formulation of the lower bound theorem of classical plasticity. The method is based on simplex finite elements and nonlinear programming and is applicable to problems in one, two and three dimensions. The use of linear finite elements guarantees that the computed collapse loads are, within computational accuracy, rigorous lower bounds on the true collaps...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید