首页> 外文会议>Fourth International Joint Conference on Computational Sciences and Optimization >Inverse Linear Program by Modifying the Right-Hand Side Vector under l1 Norm
【24h】

Inverse Linear Program by Modifying the Right-Hand Side Vector under l1 Norm

机译:通过修改l1范数下的右侧矢量来进行线性逆编程

获取原文

摘要

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.
机译:本文讨论了通过修改右向量的逆线性规划问题(ILPb)。基于对偶理论,建立了一个MPEC问题(ILPb)的数学模型,然后提供了检验(ILPb)可行性的充要条件。 $ l_1 $范数下的反问题转化为加权和型汉明距离下具有线性等式和不等式约束的问题。当双重约束条件都相等且系数矩阵可逆时,还给出了在特殊情况下的最优解。在这种情况下,线性方程组是唯一的解决方案。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号