Chen Zhi, Xue Yi. Minmum L1-Norm Estimation and Linear Programming with Variable Bounded[J]. Journal of Beijing University of Technology, 1990, 16(4): 43-47.
Citation:
Chen Zhi, Xue Yi. Minmum L1-Norm Estimation and Linear Programming with Variable Bounded[J]. Journal of Beijing University of Technology, 1990, 16(4): 43-47.
Chen Zhi, Xue Yi. Minmum L1-Norm Estimation and Linear Programming with Variable Bounded[J]. Journal of Beijing University of Technology, 1990, 16(4): 43-47.
Citation:
Chen Zhi, Xue Yi. Minmum L1-Norm Estimation and Linear Programming with Variable Bounded[J]. Journal of Beijing University of Technology, 1990, 16(4): 43-47.
Minmum L1-Norm Estimation and Linear Programming with Variable Bounded
In this paper, the proof is improved to the theorem that any definite Linear Programming problem with a bounded solution set is equivalent to the dual of a Linear Programming problem deduced from a Minimum L1-Norm estimation problem. From the equvalence, we get One-Phase Mothed for solving the Linear Programming with variable bounds by active set method of Linear Programming. MoreBack
DownLoad: