Inverse Linear Program by Modifying the Right-hand Side Vector under l1 Norm
Inverse linear programming problem (ILPb) by modifying the right-hand vector is discussed in the paper. A mathematical model of (ILPb), which is an MPEC problem, is constructed based on duality theories, and then a necessary and sufficient condition of checking the feasibility of (ILPb) is provided. The inverse problem under (1 norm is transformed into a problem under weighted sum-type Hamming distance with linear equality and inequality constraints. An optimal solution in the special case is also given when the dual constraint conditions are all equalities and the coefficient matrix is invertible. In this case, the system of linear equations has the only solution.
inverse linear programming right-hand side rec- tor duality theory l1 norm Hamming distance
Liping Liu Xiucui Guan
Jiangsu Changzhou Higher Vocational School of Construction Changzhou 213016, P.R. China Department of Mathematics Southeast University Nanjing 210096, P.R. China
国际会议
昆明、丽江
英文
471-475
2011-04-15（万方平台首次上网日期，不代表论文的发表时间）