全部 标题 作者 关键词 摘要
DOI: 10.1155/s0161171278000083
Keywords: convex cones , dual systems , polyhedrality , complex programming.
Full-Text Cite this paper Add to My Lib
A new proof of a (slightly extended) geometric version of Tucker's fundamental result is given.
Full-Text
Contact Us
service@oalib.com
QQ:3279437679
WhatsApp +8615387084133
