A algorithm for projecting a vector on the intersection of a hyperplane and
A paradox in a queueing network with state-dependent routing and loss.
A Parallel Projection Method for Solving Generalized Linear Least-Squares Problems.
A parametric study for solving nonlinear fractional problems.
A Parametric Visualization Software for the Assignment Problem
A parametrized Newton method for nonsmooth equations with finitely many maximum functions
In this paper we propose a parametrized Newton method for nonsmooth equations with finitely many maximum functions. The convergence result of this method is proved and numerical experiments are listed.
A penalty approach for a box constrained variational inequality problem
We propose a penalty approach for a box constrained variational inequality problem . This problem is replaced by a sequence of nonlinear equations containing a penalty term. We show that if the penalty parameter tends to infinity, the solution of this sequence converges to that of when the function involved is continuous and strongly monotone and the box contains the origin. We develop the algorithmic aspect with theoretical arguments properly established. The numerical results tested on...
A Periodic Loading Policy for A Flexible Transfer Line: Development And Simulation Assessment
A perturbation approach to approximate value iteration for average cost Markov decision processes with Borel spaces and bounded costs
The present paper studies the approximate value iteration (AVI) algorithm for the average cost criterion with bounded costs and Borel spaces. It is shown the convergence of the algorithm and provided a performance bound assuming that the model satisfies a standard continuity-compactness assumption and a uniform ergodicity condition. This is done for the class of approximation procedures that can be represented by linear positive operators which give exact representation of constant functions and...
A polarized adaptive schedule generation scheme for the resource-constrained project scheduling problem
This paper presents a hybrid schedule generation scheme for solving the resource-constrained project scheduling problem. The scheme, which is called the Polarized Adaptive Scheduling Scheme (PASS), can operate in a spectrum between two poles, namely the parallel and serial schedule generation schemes. A polarizer parameter in the range between zero and one indicates how similarly the PASS behaves like each of its two poles. The presented hybrid is...
A polarized adaptive schedule generation scheme for the resource-constrained project scheduling problem
This paper presents a hybrid schedule generation scheme for solving the resource-constrained project scheduling problem. The scheme, which is called the Polarized Adaptive Scheduling Scheme (PASS), can operate in a spectrum between two poles, namely the parallel and serial schedule generation schemes. A polarizer parameter in the range between zero and one indicates how similarly the PASS behaves like each of its two poles. The presented hybrid is...
A polyhedral study of a two level facility location model
We study an uncapacitated facility location model where customers are served by facilities of level one, then each level one facility that is opened must be assigned to an opened facility of level two. We identify a polynomially solvable case, and study some valid inequalities and facets of the associated polytope.
A polynomial algorithm for minDSC on a subclass of series Parallel graphs
The aim of this paper is to show a polynomial algorithm for the problem minimum directed sumcut for a class of series parallel digraphs. The method uses the recursive structure of parallel compositions in order to define a dominating set of orders. Then, the optimal order is easily reached by minimizing the directed sumcut. It is also shown that this approach cannot be applied in two more general classes of series parallel digraphs.
A Polynomial Solution for the Potato-peeling Problem.
A Polynomial-time Interior-point Algorithm for Convex Quadratic Semidefinite Optimization
In this paper we propose a primal-dual interior-point algorithm for convex quadratic semidefinite optimization problem. The search direction of algorithm is defined in terms of a matrix function and the iteration is generated by full-Newton step. Furthermore, we derive the iteration bound for the algorithm with small-update method, namely, O( log ), which is best-known bound so far.
A Polynomial-Time Linear Decision Tree for the Traveling Salesman Problem and Other NP-Complete Problems.
A porosity result in convex minimization.
A primal-dual algorithm for a constrained Fermat-Weber problem involving mixed norms
A Primal-Dual Exterior Point Algorithm for Linear Programming Problems
A primal-dual integral method in global optimization
Using the Fenchel conjugate of Phú’s Volume function F of a given essentially bounded measurable function f defined on the bounded box D ⊂ Rⁿ, the integral method of Chew and Zheng for global optimization is modified to a superlinearly convergent method with respect to the level sequence. Numerical results are given for low dimensional functions with a strict global essential supremum.