Higher-order fractional programming problem and their duality theorems in vector optimization with cone-η − invex functions
Tarun Kumar Gupta, Rajesh Tripathi, Chetan Swarup, Kuldeep Singh, Ramu Dubey, Vishnu Narayan Mishra
Abstract
Tarun Kumar Gupta, Rajesh Tripathi, Chetan Swarup, Kuldeep Singh, Ramu Dubey, Vishnu Narayan Mishra
Abstract
In this paper, we introduce a new type of generalized higher-order K-η- invex function. Wolfe-type higher-order fractional dual is proposed and corresponding duality theorems are proved. Also, we introduce generalize lemma 1 and 2, for proving Strong Duality Theorem.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper, we introduce a new type of generalized higher-order K-η- invex function. Wolfe-type higher-order fractional dual is proposed and corresponding duality theorems are proved. Also, we introduce generalize lemma 1 and 2, for proving Strong Duality Theorem.
Key concepts: Duality (order theory), Strong duality, Mathematics, Lemma (botany), Order (exchange), Fractional programming, Cone (formal languages), Wolfe duality