Startseite A new branch and bound algorithm for minimax ratios problems
Artikel Open Access

A new branch and bound algorithm for minimax ratios problems

  • Yingfeng Zhao EMAIL logo , Sanyang Liu und Hongwei Jiao
Veröffentlicht/Copyright: 22. Juni 2017
Artikel downloaden (PDF)
Open Mathematics
Aus der Zeitschrift Open Mathematics Band 15 Heft 1

Abstract

This study presents an efficient branch and bound algorithm for globally solving the minimax fractional programming problem (MFP). By introducing an auxiliary variable, an equivalent problem is firstly constructed and the convex relaxation programming problem is then established by utilizing convexity and concavity of functions in the problem. Other than usual branch and bound algorithm, an adapted partition skill and a practical reduction technique performed only in an unidimensional interval are incorporated into the algorithm scheme to significantly improve the computational performance. The global convergence is proved. Finally, some comparative experiments and a randomized numerical test are carried out to demonstrate the efficiency and robustness of the proposed algorithm.

Keywords: Fractional programming; Global optimization; Branch and bound; Adapted ratio partition
MSC 2010: 90C26; 90C30

1 Introduction

The minimax fractional programming (MFP) problem we studied in this paper can be formulated as the following nonlinear optimization problem

(MFP):minmax{n1(x)d1(x),n2(x)d2(x),…,np(x)dp(x)}s.t.gj(x)≤0,j=1,2,…,m,x∈X0={x∈Rn|li0≤xi≤ui0,i=1,2,⋯,n},

where ni(x), −di(x), i = 1, 2, ⋯, p, gj(x), j = 1, 2, ⋯, m, are all convex functions and we assume that each numerator and denominator in the objective function satisfy the following condition:

ni(x)≥0,di(x)>0,∀x∈X0,i=1,2,⋯,p. (1)

The MFP problem, which we called generalized minimax convex-concave ratios problem, is one of the most topical and useful fields in fractional programming problems, it has attracted the interest of both practitioners and researchers for many years [1–4]. The reason for studying the MFP problem is twoflod. The first one is that, from the practical point of view, the MFP problem has quite a lot of applications in various areas where several rates are to be optimized simultaneously, such as design of electronic circuits [5], biology to calculate malting efficient DNA [6], rural farming system [7], neural networks [8], management and finance [9] and system identification [10–12], to name but a few. Another reason is that, from the research point of view, the MFP problem generalizes minimax linear ratios problem [13–15] and it is neither quasiconcave nor quasiconvex, so it may have multiple local optima most of which fail to be global optimal (Example 8. and Figure 1), thus it poses significant theoretical and computational challenges. For these reasons, developing new solution methods for the problem MFP is still quite necessary and meaningful.

Figure 1 3-D image of the objective function over [0,2;0,2] in Example 7.
Figure 1

3-D image of the objective function over [0,2;0,2] in Example 7.

Over the years, several global optimization methods have been available for solving special case of the problem (MFP), include parametric programming method [16], interior-point algorithm [17], monotonic optimization approach [18] and those kinds of dinkelbach-type algorithms [19, 20]. When the numerators and denominators in the objective function of the (MFP) are all affine, Feng presents two deterministic algorithm for solving the special case of the MFP problem [14, 15]. Recently, using two-step relaxation technique, Jiao and Liu have proposed a new global optimization algorithm for solving the MFP with linear ratios and constraints [13]. Jeyakumar et al. proposed a strong duality for robust minimax fractional programming problems, when data in both of the objective and constraints are uncertainty [21]. Lai and Huang established the sufficient optimality conditions for a minimax programming problem involving p fractional n–set functions under generalized convexity [22]. Progress for the MFP problem is far advanced than mentioned above – there are many other studies about (MFP) and its special cases. Despite these various contributions, most knowledge for MFP presented in recent works focus only on optimality conditions or duality theory for special case of the MFP problem, and existing algorithm can only find its local optimal solution, or can only solve the linear form of the MFP problems. For general (MFP) investigated in this paper, to our knowledge, very few global optimization algorithms have been developed.

In this paper, we put forward an unidimensional outcome inteval branch-and-bound algorithm for globally solving the (MFP). First, a concise convex relaxation programming of the equivalent problem (EMFP) is established. Then some key operations in outcome branch and bound algorithm are described, especially the interval reduction skill can significantly improve the computational efficiency of the presented algorithm. Third, the proposed algorithm is developed by incorporating the accelerating technique as well as the adapted partition rule into the branch and bound scheme. The global convergence property is proved, numerical experimental results show that the proposed algorithm has higher computational efficiency and stronger robustness than Refs. [13] and [14, 15].

The remainder of this study is organized in the following way. In Section 2, by introducing an auxiliary variable, the MFP problem is converted into an equivalent problem (EMFP). Then the convex relaxation programming problem of the (EMFP) is established in Section 3, the linear relaxation programming for its special case, where the numerators and denominators in the objective function and the constraints are all linear, is also described in this section. Section 4 presents some key operations in branch and bound algorithm for globally solving the (MFP). An unidimensional outcome interval branch and bound algorithm for the (MFP) is introduced in Section 4. The numerical results of some test examples in recent works with the proposed algorithm are reported in Section 5, and some concluding remarks are given in the last section.

2 Equivalent problem

For solving the problem, we will first transform the problem (MFP) into an equivalent problem (EMFP) by associating all ratios in the objective function with an auxiliary variable. To this end, we first denote some notations as follows:

n_i≤ni(x)≤n¯i,d_i≤di(x)≤d¯i,ln+10=min1≤i≤p{n_id¯i},un+10=max1≤i≤p{n¯id_i};

where ni, di can be easily computed by utilizing the convexity and concavity of ni(x) and di(x), respectively. Through introducing a positive auxiliary variable xn+1, we can derive the following equivalent problem (EMFP0) of the MFP problem.

(EMFP0):minxn+1s.t.ni(x)−xn+1di(x)≤0,i=1,2,⋯,pgj(x)≤0,j=1,2,…,m,x∈X0={x∈Rn|li0≤xi≤ui0,i=1,2,⋯,n},xn+1∈D0=[ln+10,un+10],

By utilizing variable equivalence replacement tactic and changing the notation, one can thus reformulate the (EMFP0) into the following form

(EMFP):minxn+1s.t.ni(x)−xn+1(di(x)−d_i)−d_ixn+1≤0,gj(x)≤0,j=1,2,…,m,x∈X0,xn+1∈D0.

Note that, the reason why we convert the (EMFP0) into the form (EMFP) is that by isolating a linear part from the concave function di(x) we can make the convex relaxation programming more close to the initial problem (MFP), this operation will improve the algorithm significantly in efficiency which can be vindicated by numerical experiments. Moreover, in the EMFP problem, only the middle part in the first set of constraints is nonconvex. This brings a great convenience to us for building the convex relaxation problem of the initial problem. The equivalence between the problems (MFP) and (EMFP) can be obtained in the sense of the following theorem.

Theorem 2.1

If (x∗,xn+1∗)∈Rn+1 is a global optimal solution for the (EMFP), then x* ∈ Rn is a global optimal solution for the (MFP). Conversely, if x* ∈ Rn is a global optimal solution for the (MFP), then (x∗,xn+1∗)∈Rn+1 is a global optimal solution for the (EMFP), where xn+1∗=max{n1(x∗)d1(x∗),n2(x∗)d2(x∗),…,np(x∗)dp(x∗)}.

Proof

The proof of this theorem can be easily followed according to the definition of the problems (EMFP0) and (EMFP), therefore, it is omitted here.□

To solve the MFP problem, based on Theorem 2.1, we only need to solve the EMFP problem instead. Hence from now on, we will assume that the initial problem (MFP) has been of the form like (EMFP), and then our main work will focus on how to globally solve the (EMFP).

3 Convex relaxation programming problem

In this section, we construct a convex programming relaxation of the (EMFP) only with relaxed auxiliary variable in an outcome interval D. For the ease of presentation, we assume that D = [ln+1, un+1] represents either the initial outcome interval D0 of (EMFP), or modified interval generated from the branching operation in the algorithm. Next, we describe the construction process of the relaxation convex programming (RMFP) of the (EMFP) corresponding to D.

For this, we only need to consider the nonconvex constraints in (EMFP). As a matter of convenience, we denote these constraint functions with notation and number them as follows:

hi(x,xn+1)=ni(x)−xn+1(di(x)−d_i)−d_ixn+1 (2)

Assume v, v denote the best upper bound and lower bound of the objective value known so far (if no such value is founded, set v := +∞, v := −∞), respectively, and let M = min{v, un+1}, then we can obtain an underestimate function of hi(x) which can be formulated as:

h~i(x,xn+1)=ni(x)−M(di(x)−d_i)−d_ixn+1=ni(x)−Mdi(x)+Md_i−d_ixn+1, (3)

based on the definition of M and the convexity and concavity of ni(x) and di(x), it is not hard to see that h~i(x) is convex and provides a very good lower approximation for hi(x), i = 1, 2, ⋯, p. Thus, according to the above discussion, for arbitrary region Xk × Dk ⊆ X0 × D0, we can describe the convex relaxation programming problem (RMFP) corresponding to outcome interval D as follows:

(RMFP):minxn+1s.t.h~i(x,xn+1)≤0,i=1,2,⋯,p,gj(x)≤0,j=1,2,…,m,x∈X0,xn+1∈D.

Remark 3.1

The relaxation operation we used is very simple and easy to implement, that is we only need to compare two real numbers in each iteration for constructing the relaxation problem. It is quite different from usual branch and bound algorithms most of which utilize concave envelope or linearity technique to construct relaxation, and this will greatly reduce the computation time for establishing underestimate function of non-convex functions in the initial 5 source problem. for establishing underestimate function of nonconvex functions in the initial source problem. Furthermore, since relaxation operation occurs only in the unidimensional outcome interval, we can only subdivide the outcome interval in branching process. This will significantly reduce the numbers of nods in the algorithm so that the outcome interval branch and bound algorithm we presented performs better than usual branch and bound algorithms which branches in the n—dimensional variable space.

Remark 3.2

Condition (1) can be relaxed to di(x) ≠ 0, ∀x ∈ X0, i = 1, 2, ⋯; p, when functions ni(x) and di(x) are all linear, that is, the problem we considered in this paper generalized the minimax of linear ratios problem appeared in [13–15]. In fact, when ni(x) and di(x) are all linear functions, suppose instead

di(x)=∑j=1nαijxij+γi=∑j∈T+αijxi+∑j∈T−αijxij+γi>0,i=1,2,⋯,p, (4)

where T+ = {j | αij > 0}, T− = {j | αij < 0}. If not, we can substitute the ratio ni(x)di(x)with−ni(x)−di(x), then it will turn into the case identified by(4). Sequentially, the underestimate function h~i(x) can be constructed in the following way

h~i(x,xn+1)=ni(x)−Mi1∑j∈T+αijxi−Mi2∑j∈T−αijxi−γixn+1, (5)

where Mi1 = min{v, un+1}, Mi2 = max{v, ln+1}. It is much simpler and more economical to use this relaxation technique in branch and bound algorithm than that in [14, 15] where the linear relaxation programming is constructed by utilizing convex and (or) concave envelopes of bilinear functions, and the numerical test will illustrate this.

Theorem 3.3

For any x ∈ X0, xn+1 ∈ D, let Δ = |un+1 − ln+1|, then the following conclusion will be established:

h~i(x)≤hi(x),limΔ→0|h~i(x)−hi(x)|=0.

Proof

The proof of this theorem can be easily verified by the expression of h~i(x,xn+1) in (3), therefore, it is omitted here.□

Theorem 2.1 and Theorem 3.3 ensure that h~i(x,xn+1) are good underestimations for hi(x, xn+1) and will provide valid lower bounds for the optimal value of the initial problem (MFP).

4 Algorithm and its convergence

In this section, we will first present some key operations of the branch and bound algorithm, then the global optimization algorithm based on the former convex relaxation programming will be proposed, and finally, we will prove the global convergence of the present algorithm in theory.

4.1 Key operations

There are several key operations in reduced outcome interval branch and bound algorithm. The focus of these operations is to find better upper and lower bounds of the objective value at a faster pase. In our algorithm, there are three base operations: branching, reduction and bounding.

Choosing a suitable partition rule is a critical element in guaranteeing convergence to a global optimal solution, here we choose a simple and adapted bisection rule which is sufficient to ensure convergence. For any subproblem identified by hyper-rectangle

X0×D={(x,xn+1)|x∈X0,ln+1≤xn+1≤un+1}⊂X0×D0,

let q = (ln+1 + v)/2, then partition X0 × D will be subdividing into two regions X0×D¯andX0×D¯¯,whereD¯=[ln+1,q],D¯¯=[q,un+1]. Note that we only partition the outcome unidimensional interval D, the n–dimensional variable space is never partitioned in the algorithm, thus the number of partition set is much smaller than in case of those branch and bound algorithms using pure variable space partition rule. What’s more, the adapted partition technique corresponding to the current objective value will also improve the performance of the algorithm.

Moreover, the partition set generated from the branching operation can be further reduced by the special structure of the (EMFP). Actually, based on Theorem 2.1, we know that the EMFP problem has the same optimal value with the MFP problem, so when t < v, or t > v, the optimal value will not be obtained, so the partition sets D = [ln+1, q] and D¯¯=[q,un+1] can be further reduced into

D¯=[max{v_,ln+1},q]andD¯¯=[q,min{v¯,un+1}], (6)

respectively. By adding this skill into the branch and bound scheme, the performance of the algorithm will be improved obviously.

The bounding operation aims at obtaining an upper and (or) lower bound of the objective value for the initial problem (MFP). Let LB(Dk, µ) be the optimal value of the (RFP) on the μth sub-region X0 × Dk, μ and xk, μ = x(X0 × Dk, μ) be the corresponding optimal solution in the kth iteration of the algorithm. Then LBk = min{LB(Dk, μ) | μ = 1, 2, ⋯, sk} will be the new lower bound of the objective value for the (MFP), and each optimal solution xk, μ for the (RFP) is a feasible solution for the (MFP). We choose UBk = min{maxμ{ni(xk,μ)di(xk,μ)},v¯} as the new best upper bound.

4.2 Algorithm statement and convergence property

Based upon the results and key operations given in the above sections, the new branch and bound algorithm for solving the EMFP problem, and hence the MFP problem, can be described as follows.

Step 0. (Initialization) Choose convergence tolerance ϵ > 0, set iteration counter k := 0 and the initial active nod as Ω0 = X0 × D0.

Solve the initial convex relaxation problem (RMFP) over region X0 × D0, if the (RMFP) is not feasible then there is no feasible solution for the (MFP). Else, denote the optimal value and solution as f0 and xopt0 , respectively, then we can obtain the initial upper and lower bound of the optimal value for the MFP problem, that is, v := f(xopt0),andv_:=f0,wheref(x)=max{ni(x)di(x)|i=1,2,⋯,p}. And then, if v − v < ϵ, the algorithm can stop, and xopt0 is the optimal solution of the (MFP), otherwise proceed to step 1.

Step 1. (Reduction) Substitute the interval end points ln+1kandun+1k by utilizing the reduction technique (6).

Step 2. (Branching) Partition Dk into two new sub-intervals according to the adapted rule described in section 4.1. Add the new nods into the active nods set and denote the set of new partitioned intervals as D~k .

Step 3. (Bounding) For each subregion still of interest X0 × Dk, μ ⊆ X0 × D, μ = 1, 2, …, sk, obtain the optimal solution and value for the RMFP problem corresponding outcome interval Dk, μ by solving some convex programming, if LB(Dk, μ) > v, or f(xk, μ) < v then delete Dk, μ from D~k . Otherwise, let LBk = min{LB(Dk, μ) | μ = 1, 2, ⋯, sk} and UBk = min{f(xk, μ), v}, then we can update the lower and upper bounds as follows

v_=:max{v_,LBk},v_=:min{v¯,UBk},

and let

Ωk=(Ωk∖X)⋃D~k

Step 4. (Termination) Let

Ωk+1=Ωk∖{X|f(X)−LB(X)≤ϵ,X∈Ωk}.

If Ωk+1 = ∅, the algorithm can be stopped, v is the global optimal value for (MFP). Otherwise, set k : = k + 1, select Xk from Ωk with Xk=argminX∈Ωk⁡LB(X), then return to Step 3.

Theorem 4.1

The proposed algorithm either terminates within finite iterations with an optimal solution for the MFP is found, or generates an infinite sequence of iterations such that along any infinite branches of the branch-and-bound tree, any accumulation point of the sequence {xk} will be the global optimal solution of the (MFP).

Proof

(1) If the proposed algorithm is finite, it will terminate in some iteration k, k ≥ 0. And it can be known, by the termination criteria, that

v¯−v_≤ϵ.

From Step 0 and Step 3, it implies that

f(xk)−LBk≤ϵ.

Let vopt be the optimal value of the MFP problem. Then by section 3 and section 4.1, we known that

f(xk)≥vopt≥LBk.

Hence, taken together, it implies that

vopt+ϵ≥LBk+ϵ≥f(xk)≥vopt.

And thus the proof of part (1) is completed.

(2) If the algorithm is infinite and generates an infinite feasible solution sequence {(xk,xn+1k)} via solving the (RMFP). Let xn+1k=f(xk),then{(xk,xn+1k)} is a feasible solution sequence for the (EMFP). Since the sequence {xk} is bounded, it must have accumulations, without loss of generality, assume limk→∞xk=x∗. On the other hand, by the continuity of ni(x) and di(x), we can get

limk→∞xn+1k=limk→∞f(xk)=f(x∗). (7)

Also, according to the branching regulation described before, we can see that

limk→∞ln+1k=limk→∞un+1k=xn+1∗. (8)

What’ more, note that ln+1k≤f(xk)≤un+1k, taken (7) and (8) together, we can come to the conclusion that

xn+1∗=limk→∞f(xk)=f(x∗)=limk→∞x¯n+1k.

Therefore (x∗,xn+1∗) is also a feasible solution for the (EMFP). Further more, since the lower bound sequence LBk for the optimal value is increasing and lower bounded by the optimal value vopt in the algorithm, combining the continuity of xn+1, we have

limk→∞LBk=xn+1∗≤vopt≤limk→∞xn+1k=xn+1∗.

That is, (x∗,xn+1∗) is an optimal solution for the (EMFP), and of course x* is an optimal solution for the (MFP) according to the equivalence of the problems (MFP) and (EMFP), the proof is completed.□

5 Numerical experiments and results

The purpose of this section is to demonstrate the computational performance of our algorithm for the MFP problem. To this end, some numerical experiments in recent works have been carried out on a personal computer containing an Intel Core i5 processor of 2.40 GHz and 4GB of RAM. The code base is written in Matlab2014a and interfaces LINPROG for the linear relaxation problems. The comparison results are listed in Table 1. In addition, to assess the feasibility and stability of the proposed algorithm, a randomly generated test problem is given at the end of this part and the randomised experiment results are demonstrated in Table 2, Table 3, and Fig. 2, Fig. 3. Throughout this section, all problems are solved with relative/absolute optimality tolerance of 1 × 10−6, and we use Iter, Nods and Time to denote the number of iterations, maximum number of nodes stored in memory and the CPU time required in the solving process, respectively.

Figure 2 Result of random experiment 8 comparison with Ref. [13].
Figure 2

Result of random experiment 8 comparison with Ref. [13].

Figure 3 Result of random experiment 8 comparison with Ref. [15].
Figure 3

Result of random experiment 8 comparison with Ref. [15].

Table 1

Results of the numerical contrast experiments 1-7.

Example Methods Optimal value Optimal solution Iter Nods Time
1 [14] 2.2801 (1.008333333, 0.5, 1.45) 7 8 0.029
our 2.2801 (1.00833,0.500,1.4500) 3 5 0.0109
2 [15] 1.1616 (1.0, 0.55, 1.45) 113 106 0.2352
our 1.1616 (1.0000,0.5500,1.4500) 18 31 0.1332
3 [13] 0.9899 (1.3453, 0.5000, 1.946) 21 20 0.0557
[15] 0.9891 (1.3398, 0.5000, 1.943) 580 420 1.19123
our 0.9897 (1.3452,0.5000,1.9465) 16 31 0.04986
4 [13] 1.1181 (1.5049, 0.350, 1.550) 20 20 0.0820
[15] 1.1181 (1.5049, 0.350, 1.550) 747 638 1.6861
our 1.1179 (1.5053,0.3500,1.5500) 13 22 0.0641
5 [13] 1.1186 (1.7539,0.350,1.550) 2901 2534 6.5217
[15] 1.1184 (1.7529, 0.350, 1.550) 26 22 0.1488
our 1.1183 (1.7538,0.3500,1.5500) 10 12 0.0835
6 [13] 1.1186 (1.5, 1.5) 6 7 0.0048
[15] 1.1184 (1.5, 1.5) 3 4 0.0068
[18] 1.1184 (1.5, 1.5) 1 - 0.0000
our 1.48951 (1.5, 1.5) 1 1 0.0000
7 our 0.3633 (0.3668,0.6332) 9 17 0.0454
8 our 0.0742 (1.000,0.35) 12 27 0.0638
Table 2

Random numerical experiment 8 comparison with Ref. [13].

(p, m, n) Method Nods time(s)
(5,4,3) [13] 50 0.275
our 14 0.211
(6,5,5) [13] 59 0.694
our 11 0.328
(7,5,6) [13] 94 1.616
our 10 0.360
(7,5,7) [13] 27 1.079
our 19 0.552
(9,6,7) [13] 571 16.09
our 30 0.670
(9,7,10) [13] 2172 49.68
our 24 0.723
(20,7,10) [13] 12 1.847
our 20 0.623
(45,70,10) [13] 12 6.381
our 6 0.455
(50,7,10) [13] 33 1.623
our 3 0.322
Table 3

Random numerical experiment 8 comparison with Ref. [15].

(p, m, n) Method Nods time(s)
(2,1,5) [15] 1809 2.83591
our 19 0.441
(2,3,5) [15] 1811 3.63135
our 18 0.163
(3,3,5) [15] 15978 64.1806
our 13 0.355
(4,3,3) [15] 330 0.53731
our 20 0.523
(10,2,3) [15] 112 0.3793
our 10 0.423
(11,3,3) [15] 9213 42.2537
our 11 0.384
(12,3,5) [15] 12804 143.786
our 28 0.702
(18,3,5) [15] 1655 17.5244
our 16 0.523
(25,10,4) [15] 677 17.5517
our 15 0.422

Example 1

([14]).

minmax{3x1+x2−2x3+0.82x1−x2+x3,4x1−2x2+x37x1+3x2−x3,3x1+2x2−x3+1.9x1−x2+x3,4x1−x2+x38x1+4x2−x3}s.t.x1+x2−x3≤1,−x1+x2−x3≤−1,12x1+5x2+12x3≤34.8,12x1+12x2+7x3≤29.1,−6x1+x2+x3≤−4.1,1.0≤x1≤1.2,0.55≤x2≤0.65,1.35≤x3≤1.45.

Example 2

([15]).

minmax{2.1x1+2.2x2−x3+0.81.1x1−x2+1.2x3,3.1x1−x2+1.3x38.2x1+4.1x2−x3}s.t.x1+x2−x3≤1,−x1+x2−x3≤−1,12x1+5x2+12x3≤40,12x1+12x2+7x3≤50,−6x1+x2+x3≤−2,1.0≤x1≤1.2,0.55≤x2≤0.65,1.35≤x3≤1.45.

Example 3

([13, 15]).

minmax{3x1+4x2−x3+0.52x1−x2+x3+0.5,3x1−x2+3x3+0..59x1+5x2−x3+05,4x1−x2+5x3+0.511x1+6x2−x3,5x1−x2+6x3+0.512x1+7x2−x3+0.9}s.t.x1+x2−x3≤1,−X1+x2−x3≤−1,12x1+5x2+12x3≤42,12x1+12x2+7x3≤55,−6X1+x2+x3≤−3,1.0≤x1≤2,0.50≤x2≤2,0.5≤x3≤2.

Example 4

([13, 15]).

minmax{3x1+4x2−x3+0.92x1−x2+x3+0.5,3x1−x2+3x3+0..59x1+5x2−x3+05,4x1−x2+5x3+0.511x1+6x2−x3+0.9,5x1−x2+6x3+0.512x1+7x2−x3+0.9,6x1−x2+7x3+0.611x1+6x2−x3+0.9}s.t.2x1+x2−x3≤2,−2x1+x2−2x3≤−1,11x1+6x2+12x3≤45,11x1+13x2+6x3≤52,−7x1+x2+x3≤−2,1.0≤x1≤2,0.35≤x2≤0.9,1.0≤x3≤1.55.

Example 5

([13, 15]).

minmax{5x1+4x2−x3+0.93x1−x2+2x3+0.5,3x1−x2+4x3+0.59x1+3x2−x3+0.5,4x1−x2+6x3+0.512x1+7x2−x3+0.9,7x1−x2+7x3+0.511x1+9x2−x3+0.9,7x1−x2+7x3+0.711x1+7x2−x3+0.9}s.t.2x1+2x2−x3≤3,−2x1+x2−3x3≤−1,11x1+7x2+12x3≤47,13x1+13x2+6x3≤56,−6x1+2x2+3x3≤−1,1.0≤x1≤2,0.35≤x2≤0.9,1.0≤x3≤1.55.

Example 6

([13, 15, 18]).

min max { 37 x 1 + 73 x 2 + 13 13 x 1 + 13 x 2 + 13 , 63 x 1 − 18 x 2 + 39 13 x 1 + 26 x 2 + 13 } s . t . 5 x 1 − 3 x 2 = 3 , 1.5 ≤ x 1 ≤ 3.

Example 7

minmax{2x12+x22+2x1x2−3x12−2x22+4x1x2+14,x12+x1x2+x22+1−x12+5}s.t.x12+x22≤4,x1+x2≥1,

Example 8

minmax{2x12+3x226−x22,3x12+x22+4x1x2+0.5−9x12+43}s.t.2x1+3x2≤5,−2x1+x2≤−1,1≤x1≤2,0.35≤x2≤0.9.

Example 9

([13]).

minmax{∑i=1Nn1ixi+n¯1∑i=1Nd1ixi+d¯1,∑i−−1Nn2ixi+n¯2∑i=1Nd2ixi+d¯2,⋯,∑i=1Nnpixi+n¯p∑i=1Ndpixi+d¯p}s.t.Ax≤b,0≤xi≤3,i=1,2,⋯,N.

In Table 1, we provide the comparative results of our algorithm with some other methods identified in the second column of the table. It can be seen that our algorithm performs much better than other algorithms with respect to efficiency.

In Table 2, the results of randomized test compared with reference [13] are reported. Also we demonstrated the comparative results with a double y-axes broken line graph in Figure 2. From table 2 and Figure 2, it easy to see that our method is much more stable and effective than Jiao’s method.

In Table 3, the results of randomized test compared with reference [15] are reported. Also we demonstrated the comparative results with a double y-axes broken line graph in Figure 3. From table 3 and Figure 3, it easy to see that our method performed significantly better than Feng’s method in [15].

6 Concluding remarks

In this paper, we described an efficient implementation of unidimensional outcome branch and bound algorithm for global optimization of the MFP problem. Instead of using linearization or concave envelope technique, we constructed the concise convex relaxation programming by simple arithmetic operations. This relaxation method is more practical and available for convex-concave ratios problem which generalized the linear case appeared in various works. Moreover, unidimensional adapted interval partition and reduction techniques are incorporated into the algorithm scheme, which can significantly improve the performance of the algorithm. Global convergence is proved and the feasibility and robustness of the algorithm is illustrated by numerical experiments.

Acknowledgement

The authors would like to express their sincere thanks to the responsible editor and the anonymous referees for their valuable comments and suggestions, which have greatly improved the earlier version of our paper.

References

[1] Ahmad I., Husain Z., Duality in nondifferentiable minimax fractional programming with generalized convexity, Appl. Math. Comput.,2006, 176, 545-55110.1016/j.amc.2005.10.002Suche in Google Scholar

[2] Damaneh M., On fractional programming problems with absolute-value functions, Int. J. Comput. Math., 2011, 88(4), 661-66410.1080/00207161003692903Suche in Google Scholar

[3] Zhu J., Liu H., Hao B., A new semismooth newton method for NCPs based on the penalized KK function, Int.J. Comput. Math.,2012, 89(4),543-56010.1080/00207160.2011.644542Suche in Google Scholar

[4] Jiao H., Liu S., A practicable branch and bound algorithm for sum of linear ratios problem, Euro.J.Oper.Res.,2015, 243,723-73010.1016/j.ejor.2015.01.039Suche in Google Scholar

[5] Barrodale I., Best rational approximation and strict quasiconvexity, SIAM J. Numer. Anal.,1973, 10, 8-1210.1137/0710002Suche in Google Scholar

[6] Leber M., Kaderali L., A. Schnhuth, R. Schrader, A fractional programming approach to efficient DNA melting temperature calculation, Bioinformatics,2005, 21(10),2375-238210.1093/bioinformatics/bti379Suche in Google Scholar PubMed

[7] Fasakhodi A., Nouri S., Amini M., Water resources sustainability and optimal cropping pattern in farming systems:a multi-objective fractional goal programming approach, Water Res. Manag.,2010, 24,4639-465710.1007/s11269-010-9683-zSuche in Google Scholar

[8] Balasubramaniam P., Lakshmanan S., Delay-interval-dependent robust-stability criteria for neutral stochastic neural networks with polytopic and linear fractional uncertainties, Int. J. Comput. Math.,2011, 88(10), 2001-201510.1080/00207160.2010.537329Suche in Google Scholar

[9] Goedhart M., Spronk J., Financial planning with fractional, goals. Eur. J. Oper. Res.,1995,82(1),111-12410.1016/0377-2217(94)00034-ASuche in Google Scholar

[10] Ding F., Coupled-least-squares identification for multivariable systems, IET Control Theory Appl.,2013, 7(1),68-7910.1049/iet-cta.2012.0171Suche in Google Scholar

[11] Ding F., Hierarchical multi-innovation stochastic gradient algorithm for hammerstein nonlinear system modeling, Appl. Math. Model.,2013, 37,1694-170410.1016/j.apm.2012.04.039Suche in Google Scholar

[12] Liu Y., Ding R., Consistency of the extended gradient identification algorithm for multi-input multi-output systems with moving average noises, Int. J. Comput. Math., 2013,90(9),1840-185210.1080/00207160.2013.772143Suche in Google Scholar

[13] Jiao H., Liu S., A new linearization technique for minimax linear fractional programming, Int. J. Comput. Math.,2014, 91(8), 1730- 174310.1080/00207160.2013.860449Suche in Google Scholar

[14] Feng Q., Jiao H., Mao H., Chen Y., A Deterministic Algorithm for Min-max and Max-min Linear Fractional Programming Problems, Int. J. Comput. Intell. Syst.,2011,4,134-14110.1080/18756891.2011.9727770Suche in Google Scholar

[15] Feng Q., Mao H., Jiao H., A feasible method for a class of mathematical problems in manufacturing system, Key Eng.Mater.,2011,460-461,806-80910.4028/www.scientific.net/KEM.460-461.806Suche in Google Scholar

[16] Crouzeix J., Ferland J., Schaible S., An algorithm for generalized fractional programs, J. Optim. Theory Appl.1985, 47,135-14910.1007/BF00941314Suche in Google Scholar

[17] Freund R., Jarre F., An interior-point method for fractional programs with convex constraints, Math. Program.,1994, 67,407-44010.1007/BF01582229Suche in Google Scholar

[18] Phuong N., Tuy H., A unified monotonic approach to generalized linear fractional programming, J. Global Optim.,2003. 26,229-25910.1023/A:1023274721632Suche in Google Scholar

[19] Borde J., Crouzeix J., Convergence of a dinkelbach-type algorithm in generalized fractional programming, Z. Oper. Res.,1987, 31(1), A31-A5410.1007/BF01258607Suche in Google Scholar

[20] Lin J., Sheu R., Modified dinkelbach-type algorithm for generalized fractional programs with infinitely many ratios, J. Optim. Theory Appl.,2005,126(2), 323-34310.1007/s10957-005-4717-zSuche in Google Scholar

[21] Jeyakumar V., Li G., Srisatkunarajah S., Strong duality for robust minimax fractional programming problems, Eur. J. Oper. Res.,2013, 228, 331-33610.1016/j.ejor.2013.02.015Suche in Google Scholar

[22] Lai H., Huang T., Optimality conditions for nondifferentiable minimax fractional programming with complex variables, J. Math. Anal. Appl.,2009,359, 229-23910.1016/j.jmaa.2009.05.049Suche in Google Scholar
Received: 2016-12-5
Accepted: 2017-4-3
Published Online: 2017-6-22

© 2017 Zhao et al.

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

Artikel in diesem Heft

  1. Regular Articles
  2. Integrals of Frullani type and the method of brackets
  3. Regular Articles
  4. Edge of chaos in reaction diffusion CNN model
  5. Regular Articles
  6. Calculus using proximities: a mathematical approach in which students can actually prove theorems
  7. Regular Articles
  8. An investigation on hyper S-posets over ordered semihypergroups
  9. Regular Articles
  10. The Leibniz algebras whose subalgebras are ideals
  11. Regular Articles
  12. Fixed point and multidimensional fixed point theorems with applications to nonlinear matrix equations in terms of weak altering distance functions
  13. Regular Articles
  14. Matrix rank and inertia formulas in the analysis of general linear models
  15. Regular Articles
  16. The hybrid power mean of quartic Gauss sums and Kloosterman sums
  17. Regular Articles
  18. Tauberian theorems for statistically (C,1,1) summable double sequences of fuzzy numbers
  19. Regular Articles
  20. Some properties of graded comultiplication modules
  21. Regular Articles
  22. The characterizations of upper approximation operators based on special coverings
  23. Regular Articles
  24. Bi-integrable and tri-integrable couplings of a soliton hierarchy associated with SO(4)
  25. Regular Articles
  26. Dynamics for a discrete competition and cooperation model of two enterprises with multiple delays and feedback controls
  27. Regular Articles
  28. A new view of relationship between atomic posets and complete (algebraic) lattices
  29. Regular Articles
  30. A class of extensions of Restricted (s, t)-Wythoff’s game
  31. Regular Articles
  32. New bounds for the minimum eigenvalue of 𝓜-tensors
  33. Regular Articles
  34. Shintani and Shimura lifts of cusp forms on certain arithmetic groups and their applications
  35. Regular Articles
  36. Empirical likelihood for quantile regression models with response data missing at random
  37. Regular Articles
  38. Convex combination of analytic functions
  39. Regular Articles
  40. On the Yang-Baxter-like matrix equation for rank-two matrices
  41. Regular Articles
  42. Uniform topology on EQ-algebras
  43. Regular Articles
  44. Integrations on rings
  45. Regular Articles
  46. The quasilinear parabolic kirchhoff equation
  47. Regular Articles
  48. Avoiding rainbow 2-connected subgraphs
  49. Regular Articles
  50. On non-Hopfian groups of fractions
  51. Regular Articles
  52. Singularly perturbed hyperbolic problems on metric graphs: asymptotics of solutions
  53. Regular Articles
  54. Rings in which elements are the sum of a nilpotent and a root of a fixed polynomial that commute
  55. Regular Articles
  56. Superstability of functional equations related to spherical functions
  57. Regular Articles
  58. Evaluation of the convolution sum involving the sum of divisors function for 22, 44 and 52
  59. Regular Articles
  60. Weighted minimal translation surfaces in the Galilean space with density
  61. Regular Articles
  62. Complete convergence for weighted sums of pairwise independent random variables
  63. Regular Articles
  64. Binomials transformation formulae for scaled Fibonacci numbers
  65. Regular Articles
  66. Growth functions for some uniformly amenable groups
  67. Regular Articles
  68. Hopf bifurcations in a three-species food chain system with multiple delays
  69. Regular Articles
  70. Oscillation and nonoscillation of half-linear Euler type differential equations with different periodic coefficients
  71. Regular Articles
  72. Osculating curves in 4-dimensional semi-Euclidean space with index 2
  73. Regular Articles
  74. Some new facts about group 𝒢 generated by the family of convergent permutations
  75. Regular Articles
  76. lnfinitely many solutions for fractional Schrödinger equations with perturbation via variational methods
  77. Regular Articles
  78. Supersolvable orders and inductively free arrangements
  79. Regular Articles
  80. Asymptotically almost automorphic solutions of differential equations with piecewise constant argument
  81. Regular Articles
  82. Finite groups whose all second maximal subgroups are cyclic
  83. Regular Articles
  84. Semilinear systems with a multi-valued nonlinear term
  85. Regular Articles
  86. Positive solutions for Hadamard differential systems with fractional integral conditions on an unbounded domain
  87. Regular Articles
  88. Calibration and simulation of Heston model
  89. Regular Articles
  90. One kind sixth power mean of the three-term exponential sums
  91. Regular Articles
  92. Cyclic pairs and common best proximity points in uniformly convex Banach spaces
  93. Regular Articles
  94. The uniqueness of meromorphic functions in k-punctured complex plane
  95. Regular Articles
  96. Normalizers of intermediate congruence subgroups of the Hecke subgroups
  97. Regular Articles
  98. The hyperbolicity constant of infinite circulant graphs
  99. Regular Articles
  100. Scott convergence and fuzzy Scott topology on L-posets
  101. Regular Articles
  102. One sided strong laws for random variables with infinite mean
  103. Regular Articles
  104. The join of split graphs whose completely regular endomorphisms form a monoid
  105. Regular Articles
  106. A new branch and bound algorithm for minimax ratios problems
  107. Regular Articles
  108. Upper bound estimate of incomplete Cochrane sum
  109. Regular Articles
  110. Value distributions of solutions to complex linear differential equations in angular domains
  111. Regular Articles
  112. The nonlinear diffusion equation of the ideal barotropic gas through a porous medium
  113. Regular Articles
  114. The Sheffer stroke operation reducts of basic algebras
  115. Regular Articles
  116. Extensions and improvements of Sherman’s and related inequalities for n-convex functions
  117. Regular Articles
  118. Classification lattices are geometric for complete atomistic lattices
  119. Regular Articles
  120. Possible numbers of x’s in an {x, y}-matrix with a given rank
  121. Regular Articles
  122. New error bounds for linear complementarity problems of weakly chained diagonally dominant B-matrices
  123. Regular Articles
  124. Boundedness of vector-valued B-singular integral operators in Lebesgue spaces
  125. Regular Articles
  126. On the Golomb’s conjecture and Lehmer’s numbers
  127. Regular Articles
  128. Some applications of the Archimedean copulas in the proof of the almost sure central limit theorem for ordinary maxima
  129. Regular Articles
  130. Dual-stage adaptive finite-time modified function projective multi-lag combined synchronization for multiple uncertain chaotic systems
  131. Regular Articles
  132. Corrigendum to: Dual-stage adaptive finite-time modified function projective multi-lag combined synchronization for multiple uncertain chaotic systems
  133. Regular Articles
  134. Convergence and stability of generalized φ-weak contraction mapping in CAT(0) spaces
  135. Regular Articles
  136. Triple solutions for a Dirichlet boundary value problem involving a perturbed discrete p(k)-Laplacian operator
  137. Regular Articles
  138. OD-characterization of alternating groups Ap+d
  139. Regular Articles
  140. On Jordan mappings of inverse semirings
  141. Regular Articles
  142. On generalized Ehresmann semigroups
  143. Regular Articles
  144. On topological properties of spaces obtained by the double band matrix
  145. Regular Articles
  146. Representing derivatives of Chebyshev polynomials by Chebyshev polynomials and related questions
  147. Regular Articles
  148. Chain conditions on composite Hurwitz series rings
  149. Regular Articles
  150. Coloring subgraphs with restricted amounts of hues
  151. Regular Articles
  152. An extension of the method of brackets. Part 1
  153. Regular Articles
  154. Branch-delete-bound algorithm for globally solving quadratically constrained quadratic programs
  155. Regular Articles
  156. Strong edge geodetic problem in networks
  157. Regular Articles
  158. Ricci solitons on almost Kenmotsu 3-manifolds
  159. Regular Articles
  160. Uniqueness of meromorphic functions sharing two finite sets
  161. Regular Articles
  162. On the fourth-order linear recurrence formula related to classical Gauss sums
  163. Regular Articles
  164. Dynamical behavior for a stochastic two-species competitive model
  165. Regular Articles
  166. Two new eigenvalue localization sets for tensors and theirs applications
  167. Regular Articles
  168. κ-strong sequences and the existence of generalized independent families
  169. Regular Articles
  170. Commutators of Littlewood-Paley gκ∗ -functions on non-homogeneous metric measure spaces
  171. Regular Articles
  172. On decompositions of estimators under a general linear model with partial parameter restrictions
  173. Regular Articles
  174. Groups and monoids of Pythagorean triples connected to conics
  175. Regular Articles
  176. Hom-Lie superalgebra structures on exceptional simple Lie superalgebras of vector fields
  177. Regular Articles
  178. Numerical methods for the multiplicative partial differential equations
  179. Regular Articles
  180. Solvable Leibniz algebras with NFn⊕ Fm1 nilradical
  181. Regular Articles
  182. Evaluation of the convolution sums ∑al+bm=n lσ(l) σ(m) with ab ≤ 9
  183. Regular Articles
  184. A study on soft rough semigroups and corresponding decision making applications
  185. Regular Articles
  186. Some new inequalities of Hermite-Hadamard type for s-convex functions with applications
  187. Regular Articles
  188. Deficiency of forests
  189. Regular Articles
  190. Perfect codes in power graphs of finite groups
  191. Regular Articles
  192. A new compact finite difference quasilinearization method for nonlinear evolution partial differential equations
  193. Regular Articles
  194. Does any convex quadrilateral have circumscribed ellipses?
  195. Regular Articles
  196. The dynamic of a Lie group endomorphism
  197. Regular Articles
  198. On pairs of equations in unlike powers of primes and powers of 2
  199. Regular Articles
  200. Differential subordination and convexity criteria of integral operators
  201. Regular Articles
  202. Quantitative relations between short intervals and exceptional sets of cubic Waring-Goldbach problem
  203. Regular Articles
  204. On θ-commutators and the corresponding non-commuting graphs
  205. Regular Articles
  206. Quasi-maximum likelihood estimator of Laplace (1, 1) for GARCH models
  207. Regular Articles
  208. Multiple and sign-changing solutions for discrete Robin boundary value problem with parameter dependence
  209. Regular Articles
  210. Fundamental relation on m-idempotent hyperrings
  211. Regular Articles
  212. A novel recursive method to reconstruct multivariate functions on the unit cube
  213. Regular Articles
  214. Nabla inequalities and permanence for a logistic integrodifferential equation on time scales
  215. Regular Articles
  216. Enumeration of spanning trees in the sequence of Dürer graphs
  217. Regular Articles
  218. Quotient of information matrices in comparison of linear experiments for quadratic estimation
  219. Regular Articles
  220. Fourier series of functions involving higher-order ordered Bell polynomials
  221. Regular Articles
  222. Simple modules over Auslander regular rings
  223. Regular Articles
  224. Weighted multilinear p-adic Hardy operators and commutators
  225. Regular Articles
  226. Guaranteed cost finite-time control of positive switched nonlinear systems with D-perturbation
  227. Regular Articles
  228. A modified quasi-boundary value method for an abstract ill-posed biparabolic problem
  229. Regular Articles
  230. Extended Riemann-Liouville type fractional derivative operator with applications
  231. Topical Issue on Topological and Algebraic Genericity in Infinite Dimensional Spaces
  232. The algebraic size of the family of injective operators
  233. Topical Issue on Topological and Algebraic Genericity in Infinite Dimensional Spaces
  234. The history of a general criterium on spaceability
  235. Topical Issue on Topological and Algebraic Genericity in Infinite Dimensional Spaces
  236. On sequences not enjoying Schur’s property
  237. Topical Issue on Topological and Algebraic Genericity in Infinite Dimensional Spaces
  238. A hierarchy in the family of real surjective functions
  239. Topical Issue on Topological and Algebraic Genericity in Infinite Dimensional Spaces
  240. Dynamics of multivalued linear operators
  241. Topical Issue on Topological and Algebraic Genericity in Infinite Dimensional Spaces
  242. Linear dynamics of semigroups generated by differential operators
  243. Special Issue on Recent Developments in Differential Equations
  244. Isomorphism theorems for some parabolic initial-boundary value problems in Hörmander spaces
  245. Special Issue on Recent Developments in Differential Equations
  246. Determination of a diffusion coefficient in a quasilinear parabolic equation
  247. Special Issue on Recent Developments in Differential Equations
  248. Homogeneous two-point problem for PDE of the second order in time variable and infinite order in spatial variables
  249. Special Issue on Recent Developments in Differential Equations
  250. A nonlinear plate control without linearization
  251. Special Issue on Recent Developments in Differential Equations
  252. Reduction of a Schwartz-type boundary value problem for biharmonic monogenic functions to Fredholm integral equations
  253. Special Issue on Recent Developments in Differential Equations
  254. Inverse problem for a physiologically structured population model with variable-effort harvesting
  255. Special Issue on Recent Developments in Differential Equations
  256. Existence of solutions for delay evolution equations with nonlocal conditions
  257. Special Issue on Recent Developments in Differential Equations
  258. Comments on behaviour of solutions of elliptic quasi-linear problems in a neighbourhood of boundary singularities
  259. Special Issue on Recent Developments in Differential Equations
  260. Coupled fixed point theorems in complete metric spaces endowed with a directed graph and application
  261. Special Issue on Recent Developments in Differential Equations
  262. Existence of entropy solutions for nonlinear elliptic degenerate anisotropic equations
  263. Special Issue on Recent Developments in Differential Equations
  264. Integro-differential systems with variable exponents of nonlinearity
  265. Special Issue on Recent Developments in Differential Equations
  266. Elliptic operators on refined Sobolev scales on vector bundles
  267. Special Issue on Recent Developments in Differential Equations
  268. Multiplicity solutions of a class fractional Schrödinger equations
  269. Special Issue on Recent Developments in Differential Equations
  270. Determining of right-hand side of higher order ultraparabolic equation
  271. Special Issue on Recent Developments in Differential Equations
  272. Asymptotic approximation for the solution to a semi-linear elliptic problem in a thin aneurysm-type domain
  273. Topical Issue on Metaheuristics - Methods and Applications
  274. Learnheuristics: hybridizing metaheuristics with machine learning for optimization with dynamic inputs
  275. Topical Issue on Metaheuristics - Methods and Applications
  276. Nature–inspired metaheuristic algorithms to find near–OGR sequences for WDM channel allocation and their performance comparison
  277. Topical Issue on Cyber-security Mathematics
  278. Monomial codes seen as invariant subspaces
  279. Topical Issue on Cyber-security Mathematics
  280. Expert knowledge and data analysis for detecting advanced persistent threats
  281. Topical Issue on Cyber-security Mathematics
  282. Feedback equivalence of convolutional codes over finite rings
https://doi.org/10.1515/math-2017-0072
Schlagwörter für diesen Artikel
Fractional programming; Global optimization; Branch and bound; Adapted ratio partition
Creative Commons
BY-NC-ND 3.0

Artikel in diesem Heft

  1. Regular Articles
  2. Integrals of Frullani type and the method of brackets
  3. Regular Articles
  4. Edge of chaos in reaction diffusion CNN model
  5. Regular Articles
  6. Calculus using proximities: a mathematical approach in which students can actually prove theorems
  7. Regular Articles
  8. An investigation on hyper S-posets over ordered semihypergroups
  9. Regular Articles
  10. The Leibniz algebras whose subalgebras are ideals
  11. Regular Articles
  12. Fixed point and multidimensional fixed point theorems with applications to nonlinear matrix equations in terms of weak altering distance functions
  13. Regular Articles
  14. Matrix rank and inertia formulas in the analysis of general linear models
  15. Regular Articles
  16. The hybrid power mean of quartic Gauss sums and Kloosterman sums
  17. Regular Articles
  18. Tauberian theorems for statistically (C,1,1) summable double sequences of fuzzy numbers
  19. Regular Articles
  20. Some properties of graded comultiplication modules
  21. Regular Articles
  22. The characterizations of upper approximation operators based on special coverings
  23. Regular Articles
  24. Bi-integrable and tri-integrable couplings of a soliton hierarchy associated with SO(4)
  25. Regular Articles
  26. Dynamics for a discrete competition and cooperation model of two enterprises with multiple delays and feedback controls
  27. Regular Articles
  28. A new view of relationship between atomic posets and complete (algebraic) lattices
  29. Regular Articles
  30. A class of extensions of Restricted (s, t)-Wythoff’s game
  31. Regular Articles
  32. New bounds for the minimum eigenvalue of 𝓜-tensors
  33. Regular Articles
  34. Shintani and Shimura lifts of cusp forms on certain arithmetic groups and their applications
  35. Regular Articles
  36. Empirical likelihood for quantile regression models with response data missing at random
  37. Regular Articles
  38. Convex combination of analytic functions
  39. Regular Articles
  40. On the Yang-Baxter-like matrix equation for rank-two matrices
  41. Regular Articles
  42. Uniform topology on EQ-algebras
  43. Regular Articles
  44. Integrations on rings
  45. Regular Articles
  46. The quasilinear parabolic kirchhoff equation
  47. Regular Articles
  48. Avoiding rainbow 2-connected subgraphs
  49. Regular Articles
  50. On non-Hopfian groups of fractions
  51. Regular Articles
  52. Singularly perturbed hyperbolic problems on metric graphs: asymptotics of solutions
  53. Regular Articles
  54. Rings in which elements are the sum of a nilpotent and a root of a fixed polynomial that commute
  55. Regular Articles
  56. Superstability of functional equations related to spherical functions
  57. Regular Articles
  58. Evaluation of the convolution sum involving the sum of divisors function for 22, 44 and 52
  59. Regular Articles
  60. Weighted minimal translation surfaces in the Galilean space with density
  61. Regular Articles
  62. Complete convergence for weighted sums of pairwise independent random variables
  63. Regular Articles
  64. Binomials transformation formulae for scaled Fibonacci numbers
  65. Regular Articles
  66. Growth functions for some uniformly amenable groups
  67. Regular Articles
  68. Hopf bifurcations in a three-species food chain system with multiple delays
  69. Regular Articles
  70. Oscillation and nonoscillation of half-linear Euler type differential equations with different periodic coefficients
  71. Regular Articles
  72. Osculating curves in 4-dimensional semi-Euclidean space with index 2
  73. Regular Articles
  74. Some new facts about group 𝒢 generated by the family of convergent permutations
  75. Regular Articles
  76. lnfinitely many solutions for fractional Schrödinger equations with perturbation via variational methods
  77. Regular Articles
  78. Supersolvable orders and inductively free arrangements
  79. Regular Articles
  80. Asymptotically almost automorphic solutions of differential equations with piecewise constant argument
  81. Regular Articles
  82. Finite groups whose all second maximal subgroups are cyclic
  83. Regular Articles
  84. Semilinear systems with a multi-valued nonlinear term
  85. Regular Articles
  86. Positive solutions for Hadamard differential systems with fractional integral conditions on an unbounded domain
  87. Regular Articles
  88. Calibration and simulation of Heston model
  89. Regular Articles
  90. One kind sixth power mean of the three-term exponential sums
  91. Regular Articles
  92. Cyclic pairs and common best proximity points in uniformly convex Banach spaces
  93. Regular Articles
  94. The uniqueness of meromorphic functions in k-punctured complex plane
  95. Regular Articles
  96. Normalizers of intermediate congruence subgroups of the Hecke subgroups
  97. Regular Articles
  98. The hyperbolicity constant of infinite circulant graphs
  99. Regular Articles
  100. Scott convergence and fuzzy Scott topology on L-posets
  101. Regular Articles
  102. One sided strong laws for random variables with infinite mean
  103. Regular Articles
  104. The join of split graphs whose completely regular endomorphisms form a monoid
  105. Regular Articles
  106. A new branch and bound algorithm for minimax ratios problems
  107. Regular Articles
  108. Upper bound estimate of incomplete Cochrane sum
  109. Regular Articles
  110. Value distributions of solutions to complex linear differential equations in angular domains
  111. Regular Articles
  112. The nonlinear diffusion equation of the ideal barotropic gas through a porous medium
  113. Regular Articles
  114. The Sheffer stroke operation reducts of basic algebras
  115. Regular Articles
  116. Extensions and improvements of Sherman’s and related inequalities for n-convex functions
  117. Regular Articles
  118. Classification lattices are geometric for complete atomistic lattices
  119. Regular Articles
  120. Possible numbers of x’s in an {x, y}-matrix with a given rank
  121. Regular Articles
  122. New error bounds for linear complementarity problems of weakly chained diagonally dominant B-matrices
  123. Regular Articles
  124. Boundedness of vector-valued B-singular integral operators in Lebesgue spaces
  125. Regular Articles
  126. On the Golomb’s conjecture and Lehmer’s numbers
  127. Regular Articles
  128. Some applications of the Archimedean copulas in the proof of the almost sure central limit theorem for ordinary maxima
  129. Regular Articles
  130. Dual-stage adaptive finite-time modified function projective multi-lag combined synchronization for multiple uncertain chaotic systems
  131. Regular Articles
  132. Corrigendum to: Dual-stage adaptive finite-time modified function projective multi-lag combined synchronization for multiple uncertain chaotic systems
  133. Regular Articles
  134. Convergence and stability of generalized φ-weak contraction mapping in CAT(0) spaces
  135. Regular Articles
  136. Triple solutions for a Dirichlet boundary value problem involving a perturbed discrete p(k)-Laplacian operator
  137. Regular Articles
  138. OD-characterization of alternating groups Ap+d
  139. Regular Articles
  140. On Jordan mappings of inverse semirings
  141. Regular Articles
  142. On generalized Ehresmann semigroups
  143. Regular Articles
  144. On topological properties of spaces obtained by the double band matrix
  145. Regular Articles
  146. Representing derivatives of Chebyshev polynomials by Chebyshev polynomials and related questions
  147. Regular Articles
  148. Chain conditions on composite Hurwitz series rings
  149. Regular Articles
  150. Coloring subgraphs with restricted amounts of hues
  151. Regular Articles
  152. An extension of the method of brackets. Part 1
  153. Regular Articles
  154. Branch-delete-bound algorithm for globally solving quadratically constrained quadratic programs
  155. Regular Articles
  156. Strong edge geodetic problem in networks
  157. Regular Articles
  158. Ricci solitons on almost Kenmotsu 3-manifolds
  159. Regular Articles
  160. Uniqueness of meromorphic functions sharing two finite sets
  161. Regular Articles
  162. On the fourth-order linear recurrence formula related to classical Gauss sums
  163. Regular Articles
  164. Dynamical behavior for a stochastic two-species competitive model
  165. Regular Articles
  166. Two new eigenvalue localization sets for tensors and theirs applications
  167. Regular Articles
  168. κ-strong sequences and the existence of generalized independent families
  169. Regular Articles
  170. Commutators of Littlewood-Paley gκ∗ -functions on non-homogeneous metric measure spaces
  171. Regular Articles
  172. On decompositions of estimators under a general linear model with partial parameter restrictions
  173. Regular Articles
  174. Groups and monoids of Pythagorean triples connected to conics
  175. Regular Articles
  176. Hom-Lie superalgebra structures on exceptional simple Lie superalgebras of vector fields
  177. Regular Articles
  178. Numerical methods for the multiplicative partial differential equations
  179. Regular Articles
  180. Solvable Leibniz algebras with NFn⊕ Fm1 nilradical
  181. Regular Articles
  182. Evaluation of the convolution sums ∑al+bm=n lσ(l) σ(m) with ab ≤ 9
  183. Regular Articles
  184. A study on soft rough semigroups and corresponding decision making applications
  185. Regular Articles
  186. Some new inequalities of Hermite-Hadamard type for s-convex functions with applications
  187. Regular Articles
  188. Deficiency of forests
  189. Regular Articles
  190. Perfect codes in power graphs of finite groups
  191. Regular Articles
  192. A new compact finite difference quasilinearization method for nonlinear evolution partial differential equations
  193. Regular Articles
  194. Does any convex quadrilateral have circumscribed ellipses?
  195. Regular Articles
  196. The dynamic of a Lie group endomorphism
  197. Regular Articles
  198. On pairs of equations in unlike powers of primes and powers of 2
  199. Regular Articles
  200. Differential subordination and convexity criteria of integral operators
  201. Regular Articles
  202. Quantitative relations between short intervals and exceptional sets of cubic Waring-Goldbach problem
  203. Regular Articles
  204. On θ-commutators and the corresponding non-commuting graphs
  205. Regular Articles
  206. Quasi-maximum likelihood estimator of Laplace (1, 1) for GARCH models
  207. Regular Articles
  208. Multiple and sign-changing solutions for discrete Robin boundary value problem with parameter dependence
  209. Regular Articles
  210. Fundamental relation on m-idempotent hyperrings
  211. Regular Articles
  212. A novel recursive method to reconstruct multivariate functions on the unit cube
  213. Regular Articles
  214. Nabla inequalities and permanence for a logistic integrodifferential equation on time scales
  215. Regular Articles
  216. Enumeration of spanning trees in the sequence of Dürer graphs
  217. Regular Articles
  218. Quotient of information matrices in comparison of linear experiments for quadratic estimation
  219. Regular Articles
  220. Fourier series of functions involving higher-order ordered Bell polynomials
  221. Regular Articles
  222. Simple modules over Auslander regular rings
  223. Regular Articles
  224. Weighted multilinear p-adic Hardy operators and commutators
  225. Regular Articles
  226. Guaranteed cost finite-time control of positive switched nonlinear systems with D-perturbation
  227. Regular Articles
  228. A modified quasi-boundary value method for an abstract ill-posed biparabolic problem
  229. Regular Articles
  230. Extended Riemann-Liouville type fractional derivative operator with applications
  231. Topical Issue on Topological and Algebraic Genericity in Infinite Dimensional Spaces
  232. The algebraic size of the family of injective operators
  233. Topical Issue on Topological and Algebraic Genericity in Infinite Dimensional Spaces
  234. The history of a general criterium on spaceability
  235. Topical Issue on Topological and Algebraic Genericity in Infinite Dimensional Spaces
  236. On sequences not enjoying Schur’s property
  237. Topical Issue on Topological and Algebraic Genericity in Infinite Dimensional Spaces
  238. A hierarchy in the family of real surjective functions
  239. Topical Issue on Topological and Algebraic Genericity in Infinite Dimensional Spaces
  240. Dynamics of multivalued linear operators
  241. Topical Issue on Topological and Algebraic Genericity in Infinite Dimensional Spaces
  242. Linear dynamics of semigroups generated by differential operators
  243. Special Issue on Recent Developments in Differential Equations
  244. Isomorphism theorems for some parabolic initial-boundary value problems in Hörmander spaces
  245. Special Issue on Recent Developments in Differential Equations
  246. Determination of a diffusion coefficient in a quasilinear parabolic equation
  247. Special Issue on Recent Developments in Differential Equations
  248. Homogeneous two-point problem for PDE of the second order in time variable and infinite order in spatial variables
  249. Special Issue on Recent Developments in Differential Equations
  250. A nonlinear plate control without linearization
  251. Special Issue on Recent Developments in Differential Equations
  252. Reduction of a Schwartz-type boundary value problem for biharmonic monogenic functions to Fredholm integral equations
  253. Special Issue on Recent Developments in Differential Equations
  254. Inverse problem for a physiologically structured population model with variable-effort harvesting
  255. Special Issue on Recent Developments in Differential Equations
  256. Existence of solutions for delay evolution equations with nonlocal conditions
  257. Special Issue on Recent Developments in Differential Equations
  258. Comments on behaviour of solutions of elliptic quasi-linear problems in a neighbourhood of boundary singularities
  259. Special Issue on Recent Developments in Differential Equations
  260. Coupled fixed point theorems in complete metric spaces endowed with a directed graph and application
  261. Special Issue on Recent Developments in Differential Equations
  262. Existence of entropy solutions for nonlinear elliptic degenerate anisotropic equations
  263. Special Issue on Recent Developments in Differential Equations
  264. Integro-differential systems with variable exponents of nonlinearity
  265. Special Issue on Recent Developments in Differential Equations
  266. Elliptic operators on refined Sobolev scales on vector bundles
  267. Special Issue on Recent Developments in Differential Equations
  268. Multiplicity solutions of a class fractional Schrödinger equations
  269. Special Issue on Recent Developments in Differential Equations
  270. Determining of right-hand side of higher order ultraparabolic equation
  271. Special Issue on Recent Developments in Differential Equations
  272. Asymptotic approximation for the solution to a semi-linear elliptic problem in a thin aneurysm-type domain
  273. Topical Issue on Metaheuristics - Methods and Applications
  274. Learnheuristics: hybridizing metaheuristics with machine learning for optimization with dynamic inputs
  275. Topical Issue on Metaheuristics - Methods and Applications
  276. Nature–inspired metaheuristic algorithms to find near–OGR sequences for WDM channel allocation and their performance comparison
  277. Topical Issue on Cyber-security Mathematics
  278. Monomial codes seen as invariant subspaces
  279. Topical Issue on Cyber-security Mathematics
  280. Expert knowledge and data analysis for detecting advanced persistent threats
  281. Topical Issue on Cyber-security Mathematics
  282. Feedback equivalence of convolutional codes over finite rings
Jetzt anmelden und 20% sparen
Institutioneller Zugang
Wie funktioniert Authentifizierung?
Haben Sie eine Idee, wie wir unsere Website verbessern können?
Bitte schreiben Sie uns.
© 2025 De Gruyter Brill
Heruntergeladen am 10.9.2025 von https://www.degruyterbrill.com/document/doi/10.1515/math-2017-0072/html
Button zum nach oben scrollen