Many problems in mathematical programming can be described as a general linear variational inequality of the following form: find a vector u*, such thatSome iterative methods for solving a class of general linear vari...Many problems in mathematical programming can be described as a general linear variational inequality of the following form: find a vector u*, such thatSome iterative methods for solving a class of general linear variational inequalities have been presented. It is pointed out that the methods can be used to solve some practical extended programming problems.展开更多
This paper investigates various Weber problems including unconstrained Weber problems and constrained Weber problems under l1, l2 and l∞-norms. First with a transformation technique various Weber problems are turned ...This paper investigates various Weber problems including unconstrained Weber problems and constrained Weber problems under l1, l2 and l∞-norms. First with a transformation technique various Weber problems are turned into a class of monotone linear variational inequalities. By exploiting the favorable structure of these variational inequalities, we present a new projection-type method for them. Compared with some other projection-type methods which can solve monotone linear variational inequality, this new projection-type method is simple in numerical implementations and more efficient for solving this class of problems; Compared with some popular methods for solving unconstrained Weber problem and constrained Weber problem, a singularity would not happen in this new method and it is more reliable by using this new method to solve various Weber problems.展开更多
基金National Natural Science Foundation of China and the Natural Science Foundation of Jiangsu Province,China.
文摘Many problems in mathematical programming can be described as a general linear variational inequality of the following form: find a vector u*, such thatSome iterative methods for solving a class of general linear variational inequalities have been presented. It is pointed out that the methods can be used to solve some practical extended programming problems.
文摘This paper investigates various Weber problems including unconstrained Weber problems and constrained Weber problems under l1, l2 and l∞-norms. First with a transformation technique various Weber problems are turned into a class of monotone linear variational inequalities. By exploiting the favorable structure of these variational inequalities, we present a new projection-type method for them. Compared with some other projection-type methods which can solve monotone linear variational inequality, this new projection-type method is simple in numerical implementations and more efficient for solving this class of problems; Compared with some popular methods for solving unconstrained Weber problem and constrained Weber problem, a singularity would not happen in this new method and it is more reliable by using this new method to solve various Weber problems.
