Some properties of the lower bound of optimal values in interval convex quadratic programming |
| |
| Authors: | Wei Li Jianghong Jin Mengxue Xia Haohao Li Qi Luo |
| |
| Institution: | 1.Institute of Operational Research and Cybernetics,Hangzhou Dianzi University,Hangzhou,China;2.School of Data Sciences,Zhejiang University of Finance and Economics,Hangzhou,China;3.School of Information and Control,Nanjing University of Information Science and Technology,Nanjing,China |
| |
| Abstract: | One of the fundamental problems in interval quadratic programming is to compute the range of optimal values. In this paper, we derive some results on the lower bound of interval convex quadratic programming. We first develop complementary slackness conditions of a quadratic program and its Dorn dual. Then, some interesting and useful characteristics of the lower bound of interval quadratic programming are established based on these conditions. Finally, illustrative examples and remarks are given to get an insight into the problem discussed. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
