We consider the unrelated parallel machines scheduling problem where jobs have earliness and tardiness penalties and a common due date. We formulate this problem and some of its variants as 0-1 programs with quadratic objective function subject to linear constraints. The main contribution of this paper is to use and develop different convex reformulations to solve exactly the quadratic programs...

the purpose of this paper is to propose a compositeiterative scheme for approximating a common solution for a finitefamily of m-accretive operators in a strictly convex banach spacehaving a uniformly gateaux differentiable norm. as a consequence,the strong convergence of the scheme for a common fixed point ofa finite family of pseudocontractive mappings is also obtained.

the purpose of this paper is to propose a compositeiterative scheme for approximating a common solution for a finitefamily of m-accretive operators in a strictly convex banach spacehaving a uniformly gateaux differentiable norm. as a consequence,the strong convergence of the scheme for a common fixed point ofa finite family of pseudocontractive mappings is also obtained.

Euclidean Jordan-algebra is a commonly used tool in designing interiorpoint algorithms for symmetric cone programs. T -algebra, on the other hand, has rarely been used in symmetric cone programming. In this paper, we use both algebraic characterizations of symmetric cones to extend the target-following framework of linear programming to symmetric cone programming. Within this framework, we desi...

in this paper, we study the problem of minimizing the ratio of two quadratic functions subject to a quadratic constraint. first we introduce a parametric equivalent of the problem. then a bisection and a generalized newton-based method algorithms are presented to solve it. in order to solve the quadratically constrained quadratic minimization problem within both algorithms, a semidefinite optim...

A disadvantage of the SDP (semidefinite programming) relaxation method for quadratic and/or combinatorial optimization problems lies in its expensive computational cost. This paper proposes a SOCP (second-order-cone programming) relaxation method, which strengthens the lift-and-project LP (linear programming) relaxation method by adding convex quadratic valid inequalities for the positive semid...

The present paper focuses on the dynamical systems of quadratic bistochastic operators (QBO) standard simplex. In paper, we show character connection a operator with extreme operators. addition, prove that almost all are strictly regular and give description in convex polytope QBO. Furthermore, density set QBO is proved nontrivial examples given.

Working Papers are interim reports on work of the International Institute for Applied Systems Analysis and have received only limited review. Views or opinions expressed herein do not necessarily represent those of the Institute, its National Member Organizations, or other organizations supporting the work. Abstract We consider dual coordinate ascent methods for minimizing a strictly convex (po...

An algorithm for linear programming (LP) and convex quadratic programming (CQP) is proposed, based on an interior point iteration introduced more than ten years ago by J. Herskovits for the solution of nonlinear programming problems. Herskovits' iteration can be simpliied signiicantly in the LP/CQP case, and quadratic convergence from any initial point can be achieved. Interestingly the linear ...