Weak efficiency of non-smooth multiobjective programming via an h-approximation method
รหัสดีโอไอ
Creator 1. Rekha Gupta
2. Manjari Srivastava
Title Weak efficiency of non-smooth multiobjective programming via an h-approximation method
Publisher Maejo University
Publication Year 2558
Journal Title Maejo International Journal of Science and Technology
Journal Vol. 9
Journal No. 1
Page no. 82
Keyword non-smooth vector optimization,h -approximation method,generalised type I functions,Lagrange function,saddle point
ISSN 1905-7873
Abstract A non-smooth vector optimisation problem (VOP) over cones is considered. An h-approximated vector optimisation problem is constructed by modifying the objective and constraints of the VOP at a feasible point. An equivalence between their (weak) efficient solutions is given by assuming the functions involved in the VOP to be a generalised type I. Further, the definitions of Lagrange function Lh and saddle point are introduced for the h-approximated problem and saddle-point results are deduced. At the end, sufficient conditions for the existence of (weak) efficient solutions of the VOP and the saddle point of Lh are derived. Examples are given to support the results.
MaejoInternational Journal of ScienceandTechnology

บรรณานุกรม

EndNote

APA

Chicago

MLA

ดิจิตอลไฟล์

Digital File
DOI Smart-Search
สวัสดีค่ะ ยินดีให้บริการสอบถาม และสืบค้นข้อมูลตัวระบุวัตถุดิจิทัล (ดีโอไอ) สำนักการวิจัยแห่งชาติ (วช.) ค่ะ