In a recent work, cited in the Introduction, a concept of generalized pseudoconvexity was used to obtain optimality results in nonlinear programming. In the present work we give sufficient optimality conditions, in the context of the multiobjective programming problem under the assumptions of genera
On generalized pseudoconvex functions
β Scribed by Yoshihiro Tanaka; Masao Fukushima; Toshihide Ibaraki
- Publisher
- Elsevier Science
- Year
- 1989
- Tongue
- English
- Weight
- 638 KB
- Volume
- 144
- Category
- Article
- ISSN
- 0022-247X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## In this paper we introduce the concept of generaliz Boolean function. Such a function has its arguments and value-s in a Boolean &&a and can be written in a manner similar to the canonical disjunctive form, but instead of the product of sim@le or complkmented variables, the product of values of
This cycle of papers is b%ed on the concept of generalized Boolean functions introduced by the author in the fhst article of the series. Every generalized Boolean function f : B" + B can be written in a manner similar to the canonical disjunctive form using some function defined on A x B, where A is