摘要
Onthebasisoftheformulationsofthelogarithmicbarrierfunctionandtheideaoffollowingthepathofminimizersforthelogarithmicbarrierfamilyofproblemsthesocalled"centralpath"forlinearprogramming,weproposeanewframeworkofprimal-dualinfeasibleinteriorpointmethodforlinearprogrammingproblems.Withoutthestrictconvexityofthelogarithmicbarrierfunction,wegetthefollowingresults:(a)ifthehomotopyparameterμcannotreachtozero,thenthefeasiblesetoftheseprogrammingproblemsisempty;(b)ifthestrictlyfeasiblesetisnonemptyandthesolutionsetisbounded,thenforanyinitialpointx,wecanobtainasolutionoftheproblemsbythismethod;(c)ifthestrictlyfeasiblesetisnonemptyandthesolutionsetisunbounded,thenforanyinitialpointx,wecanobtaina(?)-solution;and(d)ifthestrictlyfeasiblesetisnonemptyandthesolutionsetisempty,thenwecangetthecurvex(μ),whichtowardstothegeneralizedsolutions.
出版日期
1998年02月12日（中国期刊网平台首次上网日期，不代表论文的发表时间）
