崔萌萌 程昕婧
摘要:本論述主要研究魯棒優(yōu)化問題的擬近似解的最優(yōu)性條件。通過將目標(biāo)函數(shù)和約束條件郁含有不確定信息的優(yōu)化問題轉(zhuǎn)化為魯棒優(yōu)化問題,即致力于使得不確定信息下的優(yōu)化問題最壞的解也不受不確定信息的干擾,獲得魯棒優(yōu)化問題擬近似解的最優(yōu)性條件。
關(guān)鍵詞:魯棒優(yōu)化問題;擬近似解;最優(yōu)性條件
中圖分類號(hào):0224
文獻(xiàn)標(biāo)志碼:A
1概述
故結(jié)論成立 。
參考文獻(xiàn):
[1]孫祥凱.不確定信息下凸優(yōu)化問題的魯棒解刻劃[J].數(shù)學(xué)物理學(xué)報(bào) , 2017(2):257-264.
[2]Jae Hyoung Lee, Gue Myung Lee. On approximate solutionsfor robust convex semidefinite optimization problems[J].Posi-tivity, 2018.22(3) : 845-847.
[3]V. Jeyakumar. Asymptotic Dual Conditions Characterizing Op-timality for Infinite Convex Programs[J]. Journal of Optimiza-tion Theory and Applications, 1997,93(1):153-165.
[4]BoL, Radu loan. Conjugate duality in convex optimization[M].Springer Berlin Heidelberg, 2010.
[5]Sun X.K..Li X.B.,Long X.J.,et al. On robust approximate opti-mal solutions for uncertain convex optimization and applica-tions to multi-objective optimization[J].Pacific Journal of Op-timization.2017,13(4):621-643.
[6]Sun X.K.,Teo K.L.,Zeng J.,et al. On approximate solutionsand saddle point theorems for robust convex optimization [J].Optimization Letters.2019.
收稿日期:2020-06-16
基金項(xiàng)目:同家級(jí)大學(xué)生創(chuàng)新訓(xùn)練項(xiàng)目(項(xiàng)目編號(hào):201911407021)。
作者簡介:崔萌萌(1999-),女,漢族,黑龍江綏化人,大學(xué)本科,主要研究方向:最優(yōu)化理論與方法。