On Higher-Order Duality In Nondifferentiable Minimax Fractional Programming

APPLICATIONS AND APPLIED MATHEMATICS-AN INTERNATIONAL JOURNAL（2020）

引用 0|浏览1

暂无评分

摘要

In this paper, we consider a nondifferentiable minimax fractional programming problem with continuously differentiable functions and formulated two types of higher-order dual models for such optimization problem. Weak, strong and strict converse duality theorems are derived under higher-order generalized invexity.

查看译文

关键词

Minimax programming, Fractional programming, Nondifferentiable programming, Higher-order duality

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要