generalized (๐-๐-๐-๐)-type i univex functions in multiobjective optimization
Clicks: 173
ID: 213221
2012
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This
article has not been analysed, so there is no overall score โ
reader engagement is measured and shown alongside.
Reader Engagement
Steady Performance
30.0
/100
173 views
29 readers
AI Quality Assessment
Not analyzed
Readership in this journal
SteadyRanked #20 of 27 articles by views in International journal of dentistry
Most read
Least read
Bar heights use a square-root scale.
Mint this article as an NFT
Not yet mintedCreate a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.
5
SUSD
one-off · no wallet required
Abstract
A new class of generalized functions (๐-๐-๐-๐)-type I univex is introduced for a nonsmooth multiobjective programming problem. Based upon these generalized functions, sufficient optimality conditions are established. Weak, strong, converse, and strict converse duality theorems are also derived for Mond-Weir-type multiobjective dual program.
| Reference Key |
kharbanda2012advancesgeneralized
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | ;Pallavi Kharbanda;Divya Agarwal;Deepa Sinha |
| Journal | International journal of dentistry |
| Year | 2012 |
| DOI |
10.1155/2012/279215
|
| URL | |
| Keywords |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.