A boundary element analysis for stress intensity factors of multiple circular arc cracks in a plane elasticity plate

In this paper, a numerical approach for analyzing interacting multiple cracks in infinite linear elastic media is presented. By extending Bueckner’s principle suited for a crack to a general system containing multiple interacting cracks, the original problem is divided into a homogeneous problem (the one without cracks) subjected to remote loads and a multiple crack problem in an unloaded body with applied tractions on the crack surfaces. Thus, the results in terms of the stress intensity factors (SIFs) can be obtained by considering the latter problem, which is analyzed easily by means of the displacement discontinuity method with crack-tip elements proposed recently by the author. Test examples are given to illustrate that the numerical approach is very accurate for analyzing interacting multiple cracks in an infinite linear elastic media under remote uniform stresses. In addition, the displacement discontinuity method with crack-tip elements is used to analyze a multiple crack problem in a finite plate. It is found that the boundary element method is also very accurate for investigating interacting multiple cracks in a finite plate. Specially, a generalization of Bueckner’s principle and the displacement discontinuity method with crack-tip elements are used to analyze multiple circular arc crack problems in infinite plate in tension (including: Two Collinear Circular Arc Cracks, Three Collinear Circular Arc Cracks, Two Parallel Circular Arc Cracks, Three Parallel Circular Arc Cracks and Two Circular Arc Cracks) in a plane elasticity plate. Many results are given.     

Perturbation of Fredholm eigenvalues of linear operators

We use the reduction method, which allows one to reduce the study of perturbations of multiple eigenvalues to perturbations of simple eigenvalues, to analyze the general perturbation problem for Fredholm points of the discrete spectrum of linear operator functions analytically depending on the spectral parameter. The same method is used to study a perturbation of multiple Fredholm points of the discrete Schmidt spectrum (s-numbers) of a linear operator. We present an example of a problem on a perturbation of the domain of the Sturm–Liouville problem for a second-order differential operator.     

Design of ODMA Digital Waveforms Using Non-Convex Optimization Methods

This paper presents a new approach for the design of a set of orthogonal digital filters which can be used as message-carrying waveforms in orthogonality division multiple access (ODMA) communication systems. The filter set design problem is formulated as a constrained L ₂ space optimization problem. For bandwidth efficiency, all the digital filters in the set are constrained to have approximately the same desired spectral shapes in a prescribed passband; To minimize intersymbol interference and co-channel interference, all the digital filters in the set are constrained to have low values of auto-correlation at nonzero translates of multiple symbol interval and low values of cross-correlation at all translates of multiple symbol interval. Methods for solving the proposed non-convex optimization problem are outlined. Numerical results are presented to illustrate the usefulness of the proposed method.     

Connectedness of efficient solutions in multiple criteria combinatorial optimization

In multiple criteria optimization an important research topic is the topological structure of the set X_e of efficient solutions. Of major interest is the connectedness of X_e, since it would allow the determination of Xe without considering non-efficient solutions in the process. We review general results on the subject, including the connectedness result for efficient solutions in multiple criteria linear programming. This result can be used to derive a definition of connectedness for discrete optimization problems. We present a counterexample to a previously stated result in this area, namely that the set of efficient solutions of the shortest path problem is connected. We will also show that connectedness does not hold for another important problem in discrete multiple criteria optimization: the spanning tree problem.     

On rank invariance of generalized Schwarz-Pick-Potapov block matrices of matrix-valued Carathéodory functions

In view of a multiple Nevanlinna-Pick interpolation problem, we study the rank of generalized Schwarz-Pick-Potapov block matrices of matrix-valued Carathéodory functions. Those matrices are determined by the values of a Carathéodory function and the values of its derivatives up to a certain order. We derive statements on rank invariance of such generalized Schwarz-Pick-Potapov block matrices. These results are applied to describe the case of exactly one solution for the finite multiple Nevanlinna-Pick interpolation problem and to discuss matrix-valued Carathéodory functions with the highest degree of degeneracy.     

Polynomial time algorithms for two special classes of the proportionate multiprocessor open shop

This paper describes a complex scheduling problem taken from a hospital diagnostic testing center that schedules hundreds of patients in an open shop environment consisting of multiple facilities and multiple processors. This scheduling problem, known as the multiprocessor open shop (MPOS) problem, is strongly NP-hard with few published results. Realizing that in many MPOS environments processing times are stage-dependent, not both job and stage-dependent, this paper examines a new class of problems for the MPOS—proportionate ones. This paper exploits the structural nature of the proportionate MPOS and defines new terms. Despite the enormous complexity of the MPOS problem, this work demonstrates that polynomial time algorithms exist for two special cases. Since other applications of this problem exist in service and manufacturing environments, solving the proportionate MPOS problem is not only significant in the theory of optimization, but also in many real-world applications.     

Interactive multiobjective optimization approach to the input–output design of opening new branches

We demonstrate a real-world application of the interactive multiple objective optimization (MOO) approach to the simultaneous setting of input and output amounts for the opening of new branches. As illustrated by the case example, all the branches of a fast-food company employ multiple inputs to generate multiple outputs. The company launches several new branches each year and, therefore, needs to plan the quantities of inputs and outputs to be used and produced before their operations. Such input–output settings are a vital practical problem that arises whenever a new branch is opened in a host of different industries. In this paper, we show in detail the entire process of the application from modeling the case problem to generating its solution. In the modeling stage, a data envelopment analysis model and a statistical method are subsequently utilized to form a nonlinear MOO problem for the input–output settings. To solve this problem, we then develop and apply an interactive MOO method, which combines the two earlier interactive methods ( and ), while compensating for their drawbacks and capturing their positive aspects.     

An exact algorithm for the fixed-charge multiple knapsack problem

We formulate the fixed-charge multiple knapsack problem (FCMKP) as an extension of the multiple knapsack problem (MKP). The Lagrangian relaxation problem is easily solved, and together with a greedy heuristic we obtain a pair of upper and lower bounds quickly. We make use of these bounds in the pegging test to reduce the problem size. We also present a branch-and-bound (B&B) algorithm to solve FCMKP to optimality. This algorithm exploits the Lagrangian upper bound as well as the pegging result for pruning, and at each terminal subproblem solve MKP exactly by invoking MULKNAP code developed by Pisinger [Pisinger, D., 1999. An exact algorithm for large multiple knapsack problems. European Journal of Operational Research 114, 528–541]. As a result, we are able to solve almost all test problems with up to 32,000 items and 50 knapsacks within a few seconds on an ordinary computing environment, although the algorithm remains some weakness for small instances with relatively many knapsacks.     

Optimality conditions and duality results for nonsmooth vector optimization problems with the multiple interval-valued objective function

In this paper, both Fritz John and Karush-Kuhn-Tucker necessary optimality conditions are established for a (weakly) LU-efficient solution in the considered nonsmooth multiobjective programming problem with the multiple interval-objective function. Further, the sufficient optimality conditions for a (weakly) LU-efficient solution and several duality results in Mond-Weir sense are proved under assumptions that the functions constituting the considered nondifferentiable multiobjective programming problem with the multiple interval-objective function are convex.     

On solution of total least squares problems with multiple right-hand sides

Consider a linear approximation problem AX≈B with multiple right–hand sides. When errors in the data are confirmed both to B and A, the total least squares (TLS) concept is used to solve this problem. Contrary to the standard least squares approximation problem, a solution of the TLS problem may not exist. For a single (vector) right–hand side, the classical theory has been developed by G.H. Golub, C.F. Van Loan [2], and S. Van Huffel, J. Vandewalle [4], and then complemented recently by the core problem approach of C.C. Paige, Z. Strakoš [5,6,7]. Analysis of the problem with multiple right–hand sides is still under development. In this short contribution we present conditions for the existence of a TLS solution. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Detection of multivariate outliers with location slippage or scale inflation in left orthogonally invariant or elliptically contoured distributions

This paper is concerned with two kinds of multiple outlier problems in multivariate regression. One is a multiple location-slippage problem and the other is a multiple scale-inflation problem. A multi-decision rule is proposed. Its optimality is shown for the first problem in a class of left orthogonally invariant distributions and is also shown for the second problem in a class of elliptically contoured distributions. Thus the decision rule is robust against departures from normality. Further the null robustness of the decision statistic which the rule is based on is pointed out in each problem.     

Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints

We extend the traveling salesman problem with pickup and delivery and LIFO loading (TSPPDL) by considering two additional factors, namely the use of multiple vehicles and a limitation on the total distance that a vehicle can travel; both of these factors occur commonly in practice. We call the resultant problem the multiple pickup and delivery traveling salesman problem with LIFO loading and distance constraints (MTSPPD-LD). This paper presents a thorough preliminary investigation of the MTSPPD-LD. We propose six new neighborhood operators for the problem that can be used in search heuristics or meta-heuristics. We also devise a two-stage approach for solving the problem, where the first stage focuses on minimizing the number of vehicles required and the second stage minimizes the total travel distance. We consider two possible approaches for the first stage (simulated annealing and ejection pool) and two for the second stage (variable neighborhood search and probabilistic tabu search). Our computational results serve as benchmarks for future researchers on the problem.     

On a nonstandard problem for heat conduction in a cylinder

Decay bounds are derived for the solution of a heat conduction problem in a semi-infinite cylinder when the lateral surface is held at zero temperature, a nonzero temperature is prescribed on the finite base, and the temperature at time T is prescribed to be a constant multiple of the temperature at initial time. Both energy and pointwise decay bounds are computed for a range of values of the constant multiple. Such problems were originally introduced as a means of stabilizing the backward-in-time problem for the heat equation.     

Problem on multiple eigenvalues and positive eigenfunctions for a one-dimensional second-order quasilinear equation

We consider the eigenvalue and eigenfunction problem for a one-dimensional secondorder quasilinear differential equation. We analyze a number of versions of the function f specifying the nonlinearity for which the problem has multiple eigenvalues.     

Convergence of a Ulm-like method for square inverse singular value problems with multiple and zero singular values

An interesting problem was raised in Vong et al. (SIAM J. Matrix Anal. Appl. 32:412–429, 2011): whether the Ulm-like method and its convergence result can be extended to the cases of multiple and zero singular values. In this paper, we study the convergence of a Ulm-like method for solving the square inverse singular value problem with multiple and zero singular values. Under the nonsingularity assumption in terms of the relative generalized Jacobian matrices, a convergence analysis for the multiple and zero case is provided and the quadratical convergence property is proved. Moreover, numerical experiments are given in the last section to demonstrate our theoretic results.     

Newton's Method for a Generalized Inverse Eigenvalue Problem

A kind of generalized inverse eigenvalue problem is proposed which includes the additive, multiplicative and classical inverse eigenvalue problems as special cases. Newton's method is applied, and a local convergence analysis is given for both the distinct and the multiple eigenvalue cases. When the multiple eigenvalues are present we show how to state the problem so that it is not over-determined, and discuss a Newton-method for the modified problem. We also prove that the modified method retains quadratic convergence, and present some numerical experiments to illustrate our results. © 1997 by John Wiley & Sons, Ltd.     

Scheduling programs with repetitive projects: A comparison of a simulated annealing,a genetic and a pair-wise swap algorithm

We address the problem of scheduling in programs involving the production of multiple units of the same product. Our study was motivated by a construction program for fast naval patrol boats. Other applications of this problem include procurement of multiple copies of aircraft, spacecraft, and weapon systems. In this problem we must decide how many units of the product to assign to each of a number of available crews (individuals, teams, subcontractors, etc.). These types of problems are characterized by two potentially conflicting considerations: 1) the need to complete each unit by its contractual due date, and 2) learning effects. Because of the first consideration, there is a tendency to use multiple crews for simultaneous production, so that meeting due dates is assured. However, the second consideration encourages assigning many units to a single crew so that learning effects are maximized. We study this scheduling problem with two different penalty cost structures and develop models for both versions. The models trade-off the penalty associated with late deliveries and the savings due to learning (and possibly incentive payments for early completion). We discuss different heuristic algorithms — simulated annealing, a genetic algorithm, and a pair-wise swap heuristic — as well as an exhaustive search to determine a baseline for comparisons. Our computational results show that the pair-wise swap algorithm is the most efficient solution procedure for these models.     

Invariant imbedding and multiple shooting for the solution of unstable linear boundary value problems

Invariant imbedding has been used to solve unstable linear boundary value problems for a few years. First this method is derived using the theory of characteristics; there the boundary value problem has to be imbedded in a problem of double dimension. If the corresponding Riccati equation has a critical length, one has to repeat the algorithm. A relation between this repeated invariant imbedding and multiple shooting is shown. In examples invariant imbedding, repeated invariant imbedding, multiple shooting and the superposition principle are compared.     

Reverse Convex Programming Approach in the Space of Extreme Criteria for Optimization over Efficient Sets

The problem of minimizing a convex function over the difference of two convex sets is called ‘reverse convex program’. This is a typical problem in global optimization, in which local optima are in general different from global optima. Another typical example in global optimization is the optimization problem over the efficient set of a multiple criteria programming problem. In this article, we investigate some special cases of optimization problems over the efficient set, which can be transformed equivalently into reverse convex programs in the space of so-called extreme criteria of multiple criteria programming problems under consideration. A suitable algorithm of branch and bound type is then established for globally solving resulting problems. Preliminary computational results with the proposed algorithm are reported.