作者: 任意 時(shí)間: 2025-3-21 21:44 作者: 脫落 時(shí)間: 2025-3-22 01:54
Heuristics for the Process Network Synthesis Problem,find a suitable network of operating units which produces the desired products from the given raw materials. By considering this network design from a structural point of view, we obtain a combinatorial optimization problem called the Process Network Synthesis or (PNS) problem. It is known that the 作者: myopia 時(shí)間: 2025-3-22 05:07
Heuristics for Simplified Process Network Synthesis (PNS) Problems with a Blossom-Type Algorithm foch the total number of input and output materials is at most 3. This observation facilitates useful application of the Edge Covering Problem of weighted graphs, which can be used to develop a new heuristic procedure for the PNS problem.作者: Stable-Angina 時(shí)間: 2025-3-22 12:41
The Linear Complementarity Problem and the Class of Generalized Positive Subdefinite Matrices,e solution set to a given LCP always contains the KKT-set of the corresponding quadratic programming problem. The reverse implication holds only for some very special classes of matrices as positive semidefinite, P-, row adequate, row sufficient and positive subdefinite (.)matrices. The paper extend作者: Brittle 時(shí)間: 2025-3-22 13:45
Computer Experiences with Successive Regression Approximations for Solving Equations,r-ministic function values. Here we apply this method to noisy function values. A set of Fortran subroutines, performing the actual computations has been developed, among them a subroutine, capable of computing the gradient of the multidimen-sional normal distribution. A short description of the met作者: Cerebrovascular 時(shí)間: 2025-3-22 17:59
A Bundle of Smooth Lagrangians in Mathematical Programming,ity problem is stated and sufficient conditions for the zero duality gap are formulated. In the case of smooth mathematical programming problems this general approach leads to Exact Nonsmooth Penalty functions. It is shown that a smooth Lagrange function exists in the case where the so-called ‘a(chǎn)bstr作者: dithiolethione 時(shí)間: 2025-3-22 21:20 作者: Alpha-Cells 時(shí)間: 2025-3-23 02:23 作者: instate 時(shí)間: 2025-3-23 08:48
Duality For D.C. Optimization Over Compact Sets,0, 8, 3, 12, 11, 4] and references therein). This paper contains an alternative approach to the duality theory for d.c. programming problems developed in [6]. That theory associates to the general problem of minimizing a d.c. function under several d.c. constraints on an arbitrary locally convex spa作者: GET 時(shí)間: 2025-3-23 10:16
Characterization of Monotone Operators by Using a Special Class of Preinvex Functions,.>.where <. , .> denotes the canonical scalar product of ... If . is hemicontinuous, it will be proved that . is monotone (with respect to duality) if and only if its scalar increment is preinvex in every point of ... A special class of preinvex functions, called starvex functions, will be introduce作者: 凝結(jié)劑 時(shí)間: 2025-3-23 14:44
Two Approaches for Parallelizing the UEGO Algorithm,. The skeleton of the algorithm is a parallel hillclimber. The separate hillclimbers work in restricted search regions (or clusters) of the search space. The volume of the clusters decreases as the search proceeds which results in a cooling effect similar to simulated annealing. Вesides this, UEGO c作者: 文字 時(shí)間: 2025-3-23 18:07 作者: peptic-ulcer 時(shí)間: 2025-3-24 00:39
,Packing Equal Circles in a Square II. — New Results for up to 100 Circles Using the TAMSASS-PECS Alare. It will be shown that our procedure can find most of the optimal solutions for all the problems previously solved and reported in the literature. Results obtained by our algorithm for up to 100 circles are given in relevant numerical and graphical form. For . = 32, 37, 47, 62 and 72 the algorit作者: 委托 時(shí)間: 2025-3-24 04:12 作者: SPECT 時(shí)間: 2025-3-24 10:23
A Minimization Problem in Function Spaces, bounded set and put supp(.):. {. ∈ ..: .(x) ≠ 0}. We call . if there is a function .. → .. which is periodic(mod .) and such that . (.) = .(.),[a.е.] . ∈ supp(.). We call the set . ? . an . of . if (i) there are at least two . ∈ . such that . = a - ., . = . - . for some a, . ∈ supp(.), y, z ∈ . and作者: 討好美人 時(shí)間: 2025-3-24 12:51
1384-6485 Matrahaza, Hungary, between 27-31 March 1999. This conference was organized by the Laboratory of Operations Research and Deci- sion Systems at the Computer and Automation Institute, Hungarian Academy of Sciences. The editors hope this volume will contribute to the theory and applications of mathema作者: 租約 時(shí)間: 2025-3-24 18:03 作者: Biofeedback 時(shí)間: 2025-3-24 22:03
A Bundle of Smooth Lagrangians in Mathematical Programming,such that the minimizer of the constrained problem is an inf-stationary point of the Lagrangian. However, a bundle of smooth Lagrangians exists such that the minimizer of the constrained problem is an inf-stationary point of each of these Lagrangians. This new phenomenon is promising and may be used to construct numerical algorithms.作者: fodlder 時(shí)間: 2025-3-25 02:03 作者: NAV 時(shí)間: 2025-3-25 06:01
Two Approaches for Parallelizing the UEGO Algorithm,n is to ensure that a hill is explored only by one hillclimber. UEGO makes periodic attempts to find new hills to climb. Two parallel algorithms of UEGO have been implemented and empirical results are also presented including an analysis of speedup.作者: Subjugate 時(shí)間: 2025-3-25 08:39 作者: 樸素 時(shí)間: 2025-3-25 12:35 作者: 死亡 時(shí)間: 2025-3-25 18:40
Computer Experiences with Successive Regression Approximations for Solving Equations,hod, its convergence, the subroutines and computer experiences are given in this paper. Numerical examples and results of computer runs are presented up to fifteen dimensions. According to the numerical results the error of the approximate root depends inversely on the square root of the number of points used in the approximation.作者: 蘆筍 時(shí)間: 2025-3-25 22:33 作者: Bravado 時(shí)間: 2025-3-26 03:55
,Packing Equal Circles in a Square II. — New Results for up to 100 Circles Using the TAMSASS-PECS Alhm has obtained better solutions than those reported on in the literature on packing. In addition, forty new and unpublished packing results are reported on. The arrangements obtained were validated by interval arithmetic computations.作者: Extemporize 時(shí)間: 2025-3-26 08:08
On Duality for Quasi-convex Supremization and Reverse Convex Infimization,, by a family of dualities depending on the primal constraint set. For the study of some particular cases, we introduce various families of dualities, which may have interest also for other applications.作者: 終端 時(shí)間: 2025-3-26 11:39
The Linear Complementarity Problem and the Class of Generalized Positive Subdefinite Matrices,ome very special classes of matrices as positive semidefinite, P-, row adequate, row sufficient and positive subdefinite (.)matrices. The paper extends the concept of . matrices and proves that, the above coincidence still holds for this larger class of matrices.作者: 儀式 時(shí)間: 2025-3-26 15:29 作者: 話 時(shí)間: 2025-3-26 19:01 作者: 民間傳說(shuō) 時(shí)間: 2025-3-26 23:03
Optimization Theory978-1-4613-0295-7Series ISSN 1384-6485 作者: 消滅 時(shí)間: 2025-3-27 02:27
Lower and Upper Bounds on the Probability of the Union of Some Events with Applications,Lower and upper bounds on the probability of the union of some events are presented. The bounds are based on special hypergraphs called (.,)-hyper-multitrees. A new probability bounding technique based on the bounds is described and it is applied to estimate the value of multivariate normal distribution functions.作者: 同來(lái)核對(duì) 時(shí)間: 2025-3-27 07:54 作者: Flagging 時(shí)間: 2025-3-27 10:10
Convexification of Functions by Nonlinear Coordinate Transformations,The convexification of continuous and smooth functions are related to the choice of Riemannian metrics originated from regular nonlinear coordinate transformations.作者: 六個(gè)才偏離 時(shí)間: 2025-3-27 17:23 作者: 卡死偷電 時(shí)間: 2025-3-27 20:09 作者: PLIC 時(shí)間: 2025-3-28 00:15
,Packing Equal Circles in a Square I. — Problem Setting and Bounds for Optimal Solutions,this problem defined on the basis of regular arrangements. Also, there will new upper bounds be established based on the computation of the areas of circle and minimum gap between circles and between circles and sides of the square. The paper also contains all the known exact values of optimal packings and the corresponding minimal polynomials.作者: 急急忙忙 時(shí)間: 2025-3-28 04:47 作者: obsession 時(shí)間: 2025-3-28 09:40
https://doi.org/10.1007/978-1-4613-0295-7algorithms; Approximation; calculus; computer; inequality; Mathematica; operations research; optimization; p作者: novelty 時(shí)間: 2025-3-28 11:22
5樓作者: 滲透 時(shí)間: 2025-3-28 18:38
5樓作者: 拾落穗 時(shí)間: 2025-3-28 22:02
5樓作者: GRE 時(shí)間: 2025-3-29 01:43
5樓作者: Dri727 時(shí)間: 2025-3-29 06:12
6樓作者: DENT 時(shí)間: 2025-3-29 10:49
6樓作者: nostrum 時(shí)間: 2025-3-29 15:20
6樓作者: TEM 時(shí)間: 2025-3-29 16:40
6樓作者: Pde5-Inhibitors 時(shí)間: 2025-3-29 22:50
7樓作者: 營(yíng)養(yǎng) 時(shí)間: 2025-3-30 03:38
7樓作者: allergen 時(shí)間: 2025-3-30 05:19
7樓作者: Ceramic 時(shí)間: 2025-3-30 10:53
7樓作者: 慷慨援助 時(shí)間: 2025-3-30 14:48
8樓作者: neurologist 時(shí)間: 2025-3-30 19:04
8樓作者: avulsion 時(shí)間: 2025-3-30 21:18
8樓作者: 面包屑 時(shí)間: 2025-3-31 00:54
8樓作者: 疏忽 時(shí)間: 2025-3-31 05:59
9樓作者: Delirium 時(shí)間: 2025-3-31 13:07
9樓作者: accessory 時(shí)間: 2025-3-31 16:38
9樓作者: Congruous 時(shí)間: 2025-3-31 20:13
9樓作者: Blasphemy 時(shí)間: 2025-3-31 23:56
10樓作者: SMART 時(shí)間: 2025-4-1 04:21
10樓作者: 積云 時(shí)間: 2025-4-1 07:07
10樓作者: 情節(jié)劇 時(shí)間: 2025-4-1 10:16
10樓
