THE SUFFICIENT EFFICIENCY CONDITIONS IN SEMIINFINITE MULTIOBJECTIVE FRACTIONAL PROGRAMMING UNDER HIGHER ORDER EXPONENTIAL TYPE HYBRID TYPE INVEXITIES

First, a class of higher order exponential type hybrid （α,β, γ, η, p, h（.,.）, κ（., .）, w（.,., .）, ω（.,.,.）, θ）-invexities is introduced, second, some parametrically sufficient efficiency conditions based on the higher order exponential type hybrid invexities are established, and finally some parametrically sufficient efficiency results under the higher order exponential type hybrid （a,β, γ, ρ, h（.,.）, k（.,-）, w（-,., .）, w（.,., .）, 0）-invexities are investigated to the context of solving semiinfinite multiobjective fractional programming problems. The notions of the higher order exponential type hybrid （a, β, γ η, p, h（., .）, n（., .）, w（-,.,-）, ω（.,.,.）, 0）-invexities encompass most of the generalized invexities in the literature. To the best of our knowledge, the results on semiinfinite multiobjective fractional programming problems established in this communication are new and application-oriented toward multitime multi- objectve problems as well as multiobiective control problems.

Sufficiency and Duality for Nondif ferentiable Multiobjective Fractional Programming Problems with (Φ,ρ,α)-V-Invexity

A new concept of(Φ,ρ,α)-V-invexity for differentiable vector-valued functions is introduced,which is a generalization of differentiable scalar-valued(Φ,ρ)-invexity.Based upon the(Φ,ρ,α)-V-invex functions,sufficient optimality conditions and MondWeir type dual theorems are derived for a class of nondifferentiable multiobjective fractional programming problems in which every component of the objective function and each constraint function contain a term involving the support function of a compact convex set.

Optimality conditions and duality for a class of nondifferentiable multiobjective generalized fractional programming problems

This paper studies a class of multiobjective generalized fractional programming problems, where the numerators of objective functions are the sum of differentiable function and convex function, while the denominators are the difference of differentiable function and convex function. Under the assumption of Calmness Constraint Qualification the Kuhn-Tucker type necessary conditions for efficient solution are given, and the Kuhn-Tucker type sufficient conditions for efficient solution are presented under the assumptions of （F, α, ρ, d）-V-convexity. Subsequently, the optimality conditions for two kinds of duality models are formulated and duality theorems are proved.

The Optimal Conditions of the Linear Fractional Programming Problem with Constraint

In this article,the authors discuss the optimal conditions of the linear fractionalprogramming problem and prove that a locally optional solution is a globally optional solution and the locally optimal solution can be attained at a basic feasible solution withconstraint condition.

DUALITY FOR MULTIOBJECTIVE FRACTIONAL PROGRAMMING INVOLVING n-SET FUNCTIONS

In this paper, two duality results are established under generalized ρ-convexity conditions for a class of multiobjective fractional programmign involvign differentiable n-sten functions.

A NEW GLOBAL OPTIMIZATION ALGORITHM FOR MIXED-INTEGER QUADRATICALLY CONSTRAINED QUADRATIC FRACTIONAL PROGRAMMING PROBLEM

The mixed-integer quadratically constrained quadratic fractional programming(MIQCQFP)problem often appears in various fields such as engineering practice,management science and network communication.However,most of the solutions to such problems are often designed for their unique circumstances.This paper puts forward a new global optimization algorithm for solving the problem MIQCQFP.We first convert the MIQCQFP into an equivalent generalized bilinear fractional programming(EIGBFP)problem with integer variables.Secondly,we linearly underestimate and linearly overestimate the quadratic functions in the numerator and the denominator respectively,and then give a linear fractional relaxation technique for EIGBFP on the basis of non-negative numerator.After that,combining rectangular adjustment-segmentation technique and midpointsampling strategy with the branch-and-bound procedure,an efficient algorithm for solving MIQCQFP globally is proposed.Finally,a series of test problems are given to illustrate the effectiveness,feasibility and other performance of this algorithm.

Optimality Conditions for Generalized Convex Nonsmooth Uncertain Multi-objective Fractional Programming

This paper aims at studying optimality conditions of robust weak efficient solutions for a nonsmooth uncertain multi-objective fractional programming problem(NUMFP).The concepts of two types of generalized convex function pairs,called type-I functions and pseudo-quasi-type-I functions,are introduced in this paper for(NUMFP).Under the assumption that(NUMFP)satisfies the robust constraint qualification with respect to Clarke subdifferential,necessary optimality conditions of the robust weak efficient solution are given.Sufficient optimality conditions are obtained under pseudo-quasi-type-I generalized convexity assumption.Furthermore,we introduce the concept of robust weak saddle points to(NUMFP),and prove two theorems about robust weak saddle points.The main results in the present paper are verified by concrete examples.

Two-Level Linear Relaxation Method for Generalized Linear Fractional Programming

This paper presents an efficient algorithm for globally solving a generalized linear fractional programming problem.For establishing this algorithm,we firstly construct a two-level linear relaxation method,and by utilizing the method,we can convert the initial generalized linear fractional programming problem and its subproblems into a series of linear programming relaxation problems.Based on the branch-and-bound framework and linear programming relaxation problems,a branch-and-bound algorithm is presented for globally solving the generalized linear fractional programming problem,and the computational complexity of the algorithm is given.Finally,numerical experimental results demonstrate the feasibility and efficiency of the proposed algorithm.

Parametric Duality Models for Semi-infinite Discrete Minmax Fractional Programming Problems Involving Generalized (η,ρ)-Invex Functions

A semi-infinite programming problem is a mathematical programming problem with a finite number of variables and infinitely many constraints. Duality theories and generalized convexity concepts are important research topics in mathematical programming. In this paper, we discuss a fairly large number of paramet- ric duality results under various generalized （η,ρ）-invexity assumptions for a semi-infinite minmax fractional programming problem.

Optimization of water use structure and plantation benefit of unit water consumption using fractional programming and conditional value-at-risk model

For optimizing the water-use structure and increasing plantation benefit of unit water consumption,a multi-objective model for water resources utilization was established based on fractional programming(FP).Meanwhile,considering the stochasticity of water availability in the study area,the impact of the risk factor(λ)from a quantitative and qualitative perspective was analyzed.The chance-constrained programming(CCP)and conditional value-at-risk(CVaR)models were introduced into five important major grain production areas in Sanjiang Plain,and the crop planting structure under this condition was optimized.The results showed that,after optimization,overall benefit of cultivation increased from 42.07 billion Yuan to 42.47 billion Yuan,water consumption decreased from 15.90 billion m3 to 11.95 billion m3,the plantation benefit of unit water consumption increased from 2.65 Yuan/m3 to 3.55 Yuan/m3.Furthermore,the index of water consumption,benefit of cultivation and plantation benefit of unit water consumption showed an increasing trend with the increase of violation likelihood.However,through the quantification ofλfrom an economic perspective,the increasing ofλcould not enhance plantation benefit of unit water consumption significantly.

Saddle Point Criteria in Nonsmooth Semi-Infinite Minimax Fractional Programming Problems

This paper considers a nonsmooth semi-infinite minimax fractional programming problem（SIMFP） involving locally Lipschitz invex functions. The authors establish necessary optimality conditions for SIMFP. The authors establish the relationship between an optimal solution of SIMFP and saddle point of scalar Lagrange function for SIMFP. Further, the authors study saddle point criteria of a vector Lagrange function defined for SIMFP.

Global Parametric Sufficient Optimality Conditions for Semi-infinite Discrete Minmax Fractional Programming Problems Involving Generalized (η,ρ)-invex Functions

In this paper, we discuss a large number of sets of global parametric sufficient optimality conditions under various generalized （η,ρ）-invexity assumptions for a semi-infinite minmax fractional programming problem.

Parametric Duality Models for Semiinfinite Multiobjective Fractional Programming Problems Containing Generalized (α, η, ρ)-V-Invex Functions

In this paper, we present several parametric duality results under various generalized （a,v,p）-V- invexity assumptions for a semiinfinite multiobjective fractional programming problem.

Global Parametric Sufficient Efficiency Conditions for Semiinfinite Multiobjective Fractional Programming Problems Containing Generalized (α, η, ρ)-V-Invex Functions

Abstract In this paper, we discuss numerous sets of global parametric sufficient efficiency conditions under various generalized （a,n, p）-V-invexity assumptions for a semiinfinite multiobjective fractional programming problem.

Optimality and Duality on Fractional Multi-objective Programming Under Semilocal E-convexity

In this paper, some necessary and sufficient optimality conditions are obtained for a fractional multiple objective programming involving semilocal E-convex and related functions. Also, some dual results are established under this kind of generalized convex functions. Our results generalize the ones obtained by Preda[J Math Anal Appl, 288（2003） 365-382].

Joint Active and Passive Beamforming Design for Hybrid RIS-Aided Integrated Sensing and Communication

Integrated sensing and communication(ISAC) is considered an effective technique to solve spectrum congestion in the future. In this paper, we consider a hybrid reconfigurable intelligent surface(RIS)-assisted downlink ISAC system that simultaneously serves multiple single-antenna communication users and senses multiple targets. Hybrid RIS differs from fully passive RIS in that it is composed of both active and passive elements, with the active elements having the effect of amplifying the signal in addition to phase-shifting. We maximize the achievable sum rate of communication users by collaboratively improving the beamforming matrix at the dual function base station(DFBS) and the phase-shifting matrix of the hybrid RIS, subject to the transmit power constraint at the DFBS, the signal-to-interference-plus-noise-ratio(SINR) constraint of the radar echo signal and the RIS constraint are satisfied at the same time. The builtin RIS-assisted ISAC design problem model is significantly non-convex due to the fractional objective function of this optimization problem and the coupling of the optimization variables in the objective function and constraints. As a result, we provide an effective alternating optimization approach based on fractional programming(FP) with block coordinate descent(BCD)to solve the optimization variables. Results from simulations show that the hybrid RIS-assisted ISAC system outperforms the other benchmark solutions.

Joint Beamforming Design for Dual-Functional Radar-Communication Systems Under Beampattern Gain Constraints

The joint beamforming design challenge for dual-functional radar-communication systems is addressed in this paper.The base station in these systems is tasked with simultaneously sending shared signals for both multi-user communication and target sensing.The primary objective is to maximize the sum rate of multi-user communication,while also ensuring sufficient beampattern gain at particular angles that are of interest for sensing,all within the constraints of the transmit power budget.To tackle this complex non-convex problem,an effective algorithm that iteratively optimizes the joint beamformers is developed.This algorithm leverages the techniques of fractional programming and semidefinite relaxation to achieve its goals.The numerical results confirm the effectiveness of the proposed algorithm.

User scheduling and power allocation for downlink multi-cell multi-carrier NOMA systems

In Non-Orthogonal Multiple Access(NOMA),the best way to fully exploit the benefits of the system is the efficient resource allocation.For the NOMA power domain,the allocation of power and spectrum require solving the mixed-integer nonlinear programming NP-hard problem.In this paper,we investigate user scheduling and power allocation in Multi-Cell Multi-Carrier NOMA(MCMC-NOMA)networks.To achieve that,we consider Weighted Sum Rate Maximization(WSRM)and Weighted Sum Energy Efficiency Maximization(WSEEM)problems.First,we tackle the problem of user scheduling for fixed power using Fractional Programming(FP),the Lagrange dual method,and the decomposition method.Then,we consider Successive Pseudo-Convex Approximation(SPCA)to deal with the WSRM problem.Finally,for the WSEEM problem,SPCA is utilized to convert the problem into separable scalar problems,which can be parallelly solved.Thus,the Dinkelbach algorithm and constraints relaxation are used to characterize the closed-form solution for power allocation.Extensive simulations have been implemented to show the efficiency of the proposed framework and its superiority over other existing schemes.

CoMP-transmission-based energy-efficient scheme selection algorithm for LTE-A systems

In order to achieve higher system energy efficiency （EE）,a new coordinated multipoint （CoMP）-transmission-based scheme selection energy saving （CTSES）algorithm is proposed for downlink homogeneous cellular networks.The problem is formulated as an optimization of maximizing system EE,under the constraints of the data rate requirement and the maximum transmit power.The problem is decomposed into power allocation and alternative scheme selection problems.Optimal power allocation is calculated for CoMP-JT （joint transmission）and CoMP-CS （coordinated scheduling） transmissions,and the scheme with higher EE is chosen. Since the optimal problem is a nonlinear fractional optimization problem for both CoMP transmission schemes, the problem is transformed into an equivalent problem using the parametric method. The optimal transmit power and optimal EE are obtained by an iteration algorithm in CoMP-JT and CoMP-CS schemes.Simulation results show that the proposed algorithm offers obvious energy-saving potential and outperforms the fixed CoMP transmission scheme.Under the condition of the same maximum transmit power limit,the empirical regularity of user distribution for scheme choice is presented, and using this regularity, the computational complexity can be reduced.

Joint Beamforming Optimization for Reconfigurable Intelligent Surface-Enabled MISO-OFDM Systems

In this paper,we investigate the reconfigurable intelligent surface(RIS)-enabled multiple-input-single-output orthogonal frequency division multiplexing(MISO-OFDM)system under frequency-selective channels,and propose a low-complexity alternating optimization(AO)based joint beamforming and RIS phase shifts optimization algorithm to maximize the achievable rate.First,with fixed RIS phase shifts,we devise the optimal closedform transmit beamforming vectors corresponding to different subcarriers.Then,with given active beamforming vectors,near-optimal RIS reflection coefficients can be determined efficiently leveraging fractional programming(FP)combined with manifold optimization(MO)or majorization-minimization(MM)framework.Additionally,we also propose a heuristic RIS phase shifts design approach based on the sum of subcarrier gain maximization(SSGM)criterion requiring lower complexity.Numerical results indicate that the proposed MO/MM algorithm can achieve almost the same rate as the upper bound achieved by the semidefinite relaxation(SDR)algorithm,and the proposed SSGM based scheme is only slightly inferior to the upper bound while has much lower complexity.These results demonstrate the effectiveness of the proposed algorithms.