Abstract
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 $l_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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
