Titlebook: Infinite Programming; Proceedings of an In Edward J. Anderson,Andrew B. Philpott Conference proceedings 1985 Springer-Verlag Berlin Heidelb

掩飾

書目名稱Infinite Programming影響因子(影響力)




書目名稱Infinite Programming影響因子(影響力)學科排名




書目名稱Infinite Programming網(wǎng)絡(luò)公開度




書目名稱Infinite Programming網(wǎng)絡(luò)公開度學科排名




書目名稱Infinite Programming被引頻次




書目名稱Infinite Programming被引頻次學科排名




書目名稱Infinite Programming年度引用




書目名稱Infinite Programming年度引用學科排名




書目名稱Infinite Programming讀者反饋




書目名稱Infinite Programming讀者反饋學科排名

antiquated

Continuity and Asymptotic Behaviour of the Marginal Function in Optimal Control,Consider the following optimal control problem Minimize . subject to

有限

Minimum Norm Problems in Normed Vector Lattices,Let {x.}.I be a family of elements of a normed vector space N and let {c.}.I be a corresponding family of real numbers. Fan [3] studied the minimum norm problem: . subject to the linear inequality constraints ..

踉蹌

exophthalmos

Infinite Programming978-3-642-46564-2Series ISSN 0075-8442 Series E-ISSN 2196-9957

感染

https://doi.org/10.1007/978-3-642-46564-2Programming; duality; economics; inequality; optimization

arthrodesis

On the computation of membrane-eigenvalues by semi-infinite programming methods,ric semi-infinite problem, the parameter of which has to be adapted in such a way that a certain (nonlinear and nondiffe-rentiable) function is minimized. Some numerical methods for achieving this minimization efficiently will be discussed.

garrulous

Alternative Theorems for General Complementarity Problems, is to provide reasonably comprehensive results which rely only on the most central existence theorems for variational inequalities on (weakly) compact sets. The alternative theorem is then applied in several different frameworks.

表狀態(tài)

Nonsmooth Analysis and Optimization for a Class of Nonconvex Mappings,ons with other Lipschitz-type mappings are mentioned and a derivative in the spirit of Clarke’s generalized gradient is presented. Necessary and sufficient optimality conditions are obtained for constrained programming problems whose data functions are order Lipschitz.

馬籠頭