2021AIP conference proceedingsRequires access

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

Open publisher page 0 citations

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.

About this research paper

What this paper is about

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.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Duality (order theory), Strong duality, Mathematics, Lemma (botany), Order (exchange), Fractional programming, Cone (formal languages), Wolfe duality

Related papers

Back to paper searchBrowse research topicsOriginal source
Higher-order fractional programming problem and their duality theorems in vector optimization with cone-η − invex functions — Research Paper | ScholarLens