首页 | 本学科首页   官方微博 | 高级检索  
     检索      

ON SOME PROPERTIES OF SOLUTIONS TO SEMIDEFINITE PROGRAMMING
作者姓名:韩乔明
作者单位:Han Qiao-ming Department of Mathematics,Nanjing University,Nanjing 210093,PRC
基金项目:Project 19671041 Supported by NSFC
摘    要:It is well known that for symmetric linear programming there exists a strictly complementary solution if the primal and the dual problems are both feasible. However, this is not necessary true for symmetric or general semide finite programming even if both the primal problem and its dual problem are strictly feasible. Some other properties are also concerned.


ON SOME PROPERTIES OF SOLUTIONS TO SEMIDEFINITE PROGRAMMING
Han Qiao-ming.ON SOME PROPERTIES OF SOLUTIONS TO SEMIDEFINITE PROGRAMMING[J].Numerical Mathematics A Journal of Chinese Universities English Series,1997(2).
Authors:Han Qiao-ming
Institution:Han Qiao-ming Department of Mathematics,Nanjing University,Nanjing 210093,PRC
Abstract:It is well known~(9]) that for symmetric linear programming there exists a strictly complementary solution if the primal and the dual problems are both feasible. However, this is not necessary true for symmetric or general semidefinite programming even if both the primal problem and its dual problem are strictly feasible. Some other properties are also concerned.
Keywords:semide finite programming (SDP)  linear programming (LP)  strictly feasible  strictly complementary optimal pair  
本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号