Skip to main content
Have a personal or library account? Click to login
Efficiency and duality for E — [0, 1] convex multi-objective fractional programming Cover

Efficiency and duality for E — [0, 1] convex multi-objective fractional programming

By:   
Open Access
|Jun 2026

Abstract

Abstract:

In this paper, we are interested in the efficiency and duality criteria for multi-objective fractional programming, in which the involved functions are locally Lipschitz. We shall establish the necessary and sufficient conditions for the considered problem un-der the concept of locally Lipschitz E-[0,1] convexity assumptions. Moreover, the dual problem in the sense of Schaible is defined for locally Lipschitz E-[0,1] convex multi-objective fractional programming and several duality theorems are established.

DOI: https://doi.org/10.2478/candc-2026-0003 | Journal eISSN: 2720-4278 | Journal ISSN: 0324-8569
Language: English
Page range: 43 - 63
Submitted on: Jul 1, 2025
Accepted on: Mar 1, 2026
Published on: Jun 30, 2026
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year

© 2026 Tarek Emam, published by Systems Research Institute Polish Academy of Sciences
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.