Journal
JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS
Volume 260, Issue -, Pages 180-190Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/j.cam.2013.09.075
Keywords
Interval linear programming; Strong feasible solutions; Strong optimal solutions; Tangent cone
Categories
Funding
- National Natural Science Foundation of China [11171316]
- NSF of Zhejiang [LY12A01004]
Ask authors/readers for more resources
This paper considers optimal solutions of interval linear programming problems, in a unified framework. Necessary and sufficient conditions for checking (A, b)-strong optimality and (A, b, c)-strong optimality of interval linear programming with inequality constraints are developed. The features of the proposed methods are illustrated by some examples. (C) 2013 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
