4.2 Article

Weak optimal inverse problems of interval linear programming based on KKT conditions

Publisher

ZHEJIANG UNIV, EDITORIAL COMMITTEE APPLIED MATHEMATICS
DOI: 10.1007/s11766-021-4324-2

Keywords

interval linear programming; inverse problems; KKT conditions; weak optimal solution

Funding

  1. National Natural Science Foundation of China [11971433]
  2. First Class Discipline of Zhejiang -A (Zhejiang Gongshang University-Statistics) [1020JYN4120004G-091]
  3. Graduate Scientific Research and Innovation Foundation of Zhejiang Gongshang University

Ask authors/readers for more resources

This paper explores weak optimal inverse problems of interval linear programming based on KKT conditions. It defines the problem precisely and shows that adjusting the minimum change of the current cost coefficient can convert a weak solution to an optimal one. An equivalent characterization of weak optimal inverse IvLP problems is obtained, and the problem is simplified without adjusting the cost coefficient of null variable.
In this paper, weak optimal inverse problems of interval linear programming (IvLP) are studied based on KKT conditions. Firstly, the problem is precisely defined. Specifically, by adjusting the minimum change of the current cost coefficient, a given weak solution can become optimal. Then, an equivalent characterization of weak optimal inverse IvLP problems is obtained. Finally, the problem is simplified without adjusting the cost coefficient of null variable.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.2
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available