# canning solution set of inequality system by a combined code

## Related Articles

- A Matrix Approach to Hypergraph Stable Set and Coloring Problems with Its Application to Storing Problem. Min Meng; Jun-e Feng // Journal of Applied Mathematics;2014, p1
This paper considers the stable set and coloring problems of hypergraphs and presents several new results and algorithms using the semitensor product of matrices. By the definitions of an incidence matrix of a hypergraph and characteristic logical vector of a vertex subset, an equivalent...

- Some New Classes of Extended General Mixed Quasi-Variational Inequalities. Noor, Muhammad Aslam; Noor, Khalida Inayat // Abstract & Applied Analysis;2012, p1
We consider and study a new class of variational inequality, which is called the extended general mixed quas-variational inequality. We use the auxiliary principle technique to study the existence of a solution of the extended general mixed quasi-variational inequality. Several special cases are...

- New Double Projection Algorithm for Solving Variational Inequalities. Lian Zheng // Journal of Applied Mathematics;2013, p1
We propose a class of new double projection algorithms for solving variational inequality problem, which can be viewed as a framework of the method of Solodov and Svaiter by adopting a class of new hyperplanes. By the separation property of hyperplane, our method is proved to be globally...

- Improved lower bounds and exact algorithm for the capacitated arc routing problem. Bartolini, Enrico; Cordeau, Jean-François; Laporte, Gilbert // Mathematical Programming;Feb2013, Vol. 137 Issue 1/2, p409
In the capacitated arc routing problem (CARP), a subset of the edges of an undirected graph has to be serviced at least cost by a fleet of identical vehicles in such a way that the total demand of the edges serviced by each vehicle does not exceed its capacity. This paper describes a new lower...

- Algorithmic Approach to a Minimization Problem. Yonghong Yao; Shin Min Kang; Yeong-Cheng Liou; Zhitao Wu // Abstract & Applied Analysis;2012, p1
We first construct an implicit algorithm for solving the minimization problem minxâˆˆÎ©â€–xâ€–, where Î© is the intersection set of the solution set of some equilibrium problem, the fixed points set of a nonexpansive mapping, and the solution set of some variational inequality....

- Solving the Variational Inequality Problem Defined on Intersection of Finite Level Sets. Songnian He; Caiping Yang // Abstract & Applied Analysis;2013, p1
Consider the variational inequality VI(C,F) of finding a point xÏµcsatisfying the property... for all x Ïµ C, where C is the intersection of finite level sets of convex functions defined on a real Hilbert space H and F : H â†’ H is an L-Lipschitzian and n-stronglymonotone operator....

- A Two-Phase Algorithm for a Variational Inequality Formulation of Equilibrium Problems. Bello Cruz, J. Y.; Santos, P. S. M.; Scheimberg, S. // Journal of Optimization Theory & Applications;Dec2013, Vol. 159 Issue 3, p562
We introduce an explicit algorithm for solving nonsmooth equilibrium problems in finite-dimensional spaces. A particular iteration proceeds in two phases. In the first phase, an orthogonal projection onto the feasible set is replaced by projections onto suitable hyperplanes. In the second phase,...

- Numerical and Analytical Methods for Variational Inequalities and Related Problems 2013. Zhenyu Huang; Mohapatra, Ram N.; Shih-sen Chang; Qingzhi Yang // Journal of Applied Mathematics;2013, p1
No abstract available.

- Solving the Matrix Nearness Problem in the Maximum Norm by Applying a Projection and Contraction Method. Xu, M. H.; Shao, H. // Advances in Operations Research;2012, p1
Let S be a closed convex set of matrices and C be a given matrix. The matrix nearness problem considered in this paper is to find a matrix X in the set S at which max {âˆ£xij - cij âˆ£} reaches its minimum value. In order to solve the matrix nearness problem, the problem is reformulated to...