版权所有：内蒙古大学图书馆 技术提供：维普资讯• 智图
内蒙古自治区呼和浩特市赛罕区大学西街235号 邮编: 010021
Duality for nondifferentiable minimax fractional programming problem involving higher order (C, alpha, rho, d)-convexity
为 nondifferentiable 得最高分的战略的两重性包含更高的顺序的部分编程问题(\varvec { C } ， \varvec {\alpha } ， \varvec {\rho } ， \varvec { d }) 凸状作者机构：Indian Sch Mines Indian Inst Technol Dept Appl Math Dhanbad 826004 Jharkhand India
出 版 物：《OPSEARCH》 (运筹学；印度运筹学会志)
年 卷 期：2017年第54卷第3期
页 面：598-617页
学科分类：1201[管理学-管理科学与工程(可授管理学、工学学位)] 07[理学] 070104[理学-应用数学] 0701[理学-数学]
主 题：Minimax fractional programming problem Nondifferentiable programming Higher-order duality Higher-order (C, alpha, rho, d)-convexity
摘 要：In this paper, we present new class of higher-order (C, alpha, rho, d)-convexity and formulate two types of higher-order duality for a nondifferentiable minimax fractional programming problem. Based on the higher-order (C, alpha, rho, d)-convexity, we establish appropriate higher-order duality results. These results extend several known results to a wider class of programs.
