The low energy three nucleon problem with two particle separable potentials is solved. The formalism of Faddeev in recasting the three body equations into Fredholm form and subsequent angular momentum reductions are carried out. Upon searching for a bound state two poles of the amplitude are found. Upon further examination one of the poles is found to have a residue of the wrong sign. This diff...

the product rate variation problem minimizes the variation in the rate at which different models of a common base product are produced on the assembly lines with the assumption of negligible switch-over cost and unit processing time for each copy of each model. the assumption of significant setup and arbitrary processing times forces the problem to be a two phase problem. the first phase determ...

This work presents a method for optimum design of structures, where the design variables can he considered as Continuous or discrete. The variables are chosen as sizing variables as well as coordinates of joints. The main idea is to reduce the number of structural analyses and the overal cost of optimization. In each design cycle, first the structural response quantities such as forces, displac...

We present an approximation algorithm for the NP-hard problem of finding the largest linearly separable subset of examples among a training set. The algorithm uses, incrementally, a Linear Programming procedure. We present numerical evidence of its superiority over the Pocket algorithm used by many neural net constructive algorithms.

In this paper, we consider the problem of minimizing a strictly convex separable function over a feasible region defined by a convex inequality constraint and two-sided bounds on the variables (box constraints). Also, the convex separable program with a strictly convex objective function subject to linear equality constraints and bounded variables is considered. These problems are interesting f...

We show that Farkas’ lemma for linear inequality systems, established in 1902, continues to hold for separable sublinear inequality systems. As a consequence, we establish a qualification-free characterization of optimality for separable sublinear programming problems which include classes of robust linear programming problems.

In this paper we consider a vector integer programming problem with Pareto principle of optimality for the case where partial criteria belong to the class of separable piecewise linear functions. The limit level of the initial data’s perturbations in the space of vector criteria parameters with norms l1 and l∞, preserved Pareto optimality of the solutions is investigated. Formulas of the quasis...