Abstract
AbstractThis paper gives a theorem by which it is possible to derive in an easy way a local approximation theorem and an inverse function theorem. The latter theorems are not new. The main advantage of our paper is in giving a relatively short route to these results.
Publisher
Cambridge University Press (CUP)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. From Convex to Mixed Programming;Lecture Notes in Economics and Mathematical Systems;1985
2. On regularity conditions in mathematical programming;Optimality and Stability in Mathematical Programming;1982