Efficient interval partitioning for constrained global optimization

A new efficient interval partitioning approach to solve constrained global optimization problems is proposed. This involves a new parallel subdivision direction selection method as well as an adaptive tree search. The latter explores nodes (intervals in variable domains) using a restricted hybrid depth-first and best-first branching strategy. This hybrid approach is also used for activating local search to identify feasible stationary points. The new tree search management technique results in improved performance across standard solution and computational indicators when compared to previously proposed techniques. On the other hand, the new parallel subdivision direction selection rule detects infeasible and suboptimal boxes earlier than existing rules, and this contributes to performance by enabling earlier reliable deletion of such subintervals from the search space.     

Norm-graphs and bipartite turán numbers

For everyt>1 and positiven we construct explicit examples of graphsG with |V (G)|=n, |E(G)|c _t ·n ^2–1/t which do not contain a complete bipartite graghK _t,t !+1 This establishes the exact order of magnitude of the Turán numbers ex (n, K _t,s ) for any fixedt and allst!+1, improving over the previous probabilistic lower bounds for such pairs (t, s). The construction relies on elementary facts from commutative algebra.Research supported in part by NSF Grants DMS-8707320 and DMS-9102866.Research supported in part by Hungarian National Foundation for Scientific Research Grant     

A new heuristic and an exact approach for a production planning problem

Central European Journal of Operations Research - We deal with a very complex and hard scheduling problem. Two types of products are processed by a heterogeneous resource set, where resources have...     

Modular Group Algebras with Almost Maximal Lie Nilpotency Indices

Let be a field of positive characteristic and the group algebra of a group . It is known that, if is Lie nilpotent, then its upper (and lower) Lie nilpotency index is at most , where is the order of the commutator subgroup. The authors previously determined those groups for which this index is maximal and here they determine the groups for which it is `almost maximal', that is, it takes the next highest possible value, namely .Presented by V. Dl a b.Dedicated to Professor Vjacheslav Rudko on his 65th birthday.The research was supported by OTKA No. T 037202, No. T 038059 and Italian National Research Project “Group Theory and Application.”     

Time shifted aliasing error upper bounds for truncated sampling cardinal series

Time shifted aliasing error upper bound extremals for the sampling reconstruction procedure are fully characterized. Sharp upper bounds are found on the aliasing error of truncated cardinal series and the corresponding extremals are described for entire functions from certain specific Lp, p>1, classes. Analogous results are obtained in multidimensional regular sampling. Truncation error analysis is provided in all cases considered. Moreover, sharpness of bounding inequalities, convergence rates and various sufficient conditions are discussed.     

A polynomial path-following interior point algorithm for general linear complementarity problems

Linear Complementarity Problems (LCPs) belong to the class of \mathbbNP{\mathbb{NP}} -complete problems. Therefore we cannot expect a polynomial time solution method for LCPs without requiring some special property of the coefficient matrix. Our aim is to construct interior point algorithms which, according to the duality theorem in EP (Existentially Polynomial-time) form, in polynomial time either give a solution of the original problem or detects the lack of property P_*([(k)\tilde]){\mathcal{P}_*(\tilde\kappa)} , with arbitrary large, but apriori fixed [(k)\tilde]{\tilde\kappa}). In the latter case, the algorithms give a polynomial size certificate depending on parameter [(k)\tilde]{\tilde{\kappa}} , the initial interior point and the input size of the LCP). We give the general idea of an EP-modification of interior point algorithms and adapt this modification to long-step path-following interior point algorithms.     

Projectivep-algebras

Presented by R. Freese.