This paper develops goal programming algorithm to solve a type of least absolute value (LAV) problem. Firstly, we simplify the simplex algorithm by proving the existence of solutions of the problem. Then, we present a...This paper develops goal programming algorithm to solve a type of least absolute value (LAV) problem. Firstly, we simplify the simplex algorithm by proving the existence of solutions of the problem. Then, we present a goal programming algorithm on the basis of the original techniques. Theoretical analysis and numerical results indicate that the new method contains a lower number of deviation variables and consumes less computational time as compared to current LAV methods.展开更多
基金This research is supported by the National Natural Science Foundation of China (70301014).
文摘This paper develops goal programming algorithm to solve a type of least absolute value (LAV) problem. Firstly, we simplify the simplex algorithm by proving the existence of solutions of the problem. Then, we present a goal programming algorithm on the basis of the original techniques. Theoretical analysis and numerical results indicate that the new method contains a lower number of deviation variables and consumes less computational time as compared to current LAV methods.
