摘要：集值最优化问题近年来成为许多学者关注的热点,在某些形如（SOP）的问题中,为解决preinvex集值映射的导数不易求出,将preinvex集值映射G拆分成两个集值映射的复合积的形式,通过讨论复合映射导数的运算法则使问题简化,得到问题（CSOP）有最优解的条件。
注：因版权方要求，不能公开全文，如需全文，请咨询杂志社
热门期刊服务
China Petroleum Processing Petrochemical Technology Petroleum Science Chinese Optics Letters Applied Mathematics:A Journal of Chinese Universities Chinese Geographical Science Chinese Journal of Chemical Physics Acta Pharmacologica Sinica Research in Astronomy and Astrophysics Journal of Systems Science and Complexity Journal of Geographical Sciences Journal of Integrative Plant Biology Progress in Natural Science:Materials International