文件名称：The direct power of adjacent vertex programming methods.pdf
文件大小：567KB
文件格式：PDF
更新时间：2022-09-11 03:18:39
节点
How far does the power of the adjacent vertex methods extend in solvingnon-linear programming problems? This question here gets a partial answebeing restricted to variables and objective functions which are continuous andexcluding any transformation or approximation of the original syatem. Theunderlying concepts are that of quasi-concavity and quasi-monotonicityNecessary and sufficient characteristics of the family of objective functionare given in due generality although in some cases subjeet to several differ-entiability assumptions. For these latter cases a simple criterion of vectselection is presented. Finally the problem of linear fractional programming isbriefly discussed as an example