Generalized pseudoconvex functions and multiobjective programming

Show simple item record

dc.contributor.author Mukherjee, R.N.
dc.date.accessioned 2021-09-09T06:45:50Z
dc.date.available 2021-09-09T06:45:50Z
dc.date.issued 1997-04-01
dc.identifier.issn 0022247X
dc.identifier.uri http://localhost:8080/xmlui/handle/123456789/1650
dc.description.abstract 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 generalized pseudoconvexity on objective and constraint functions. An application of such a result is given for fractional programming also. en_US
dc.description.sponsorship Journal of Mathematical Analysis and Applications en_US
dc.language.iso en en_US
dc.relation.ispartofseries Issue 1;Volume 208
dc.subject Constraint theory; en_US
dc.subject Functions; en_US
dc.subject Optimization; en_US
dc.subject Problem solving en_US
dc.subject Fractional programming; en_US
dc.subject Generalized pseudoconvex functions; en_US
dc.subject Multiobjective programming en_US
dc.subject Nonlinear programming en_US
dc.title Generalized pseudoconvex functions and multiobjective programming en_US
dc.type Article en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search in IDR


Advanced Search

Browse

My Account