A New Reliable Operating Region Design Method

Academy of Mathematics and Systems Science, Chinese Academy of Sciences, 100190 Beijing, China School of Mathematical Sciences, University of Chinese Academy of Sciences, 100049 Beijing, China Department of Overall Technology, China North Vehicle Research Institute (No. 1 Research Academy of China Ordnance), 100072 Beijing, China School of Mechatronical Engineering, Beijing Institute of Technology, 100081 Beijing, China


Introduction
ere are many product quality indexes, among which performance and reliability are the most important. Performance is a measurement that designers use to evaluate products' operation. Reliability relates to a products' ability to perform its specified performance under the stated conditions [1].
Design, manufacture, use, maintenance, and various other factors determine the reliability of products [2,3]. In the manufacturing industry, however, the focus is upon the design and manufacture of products. It is relatively easy to evaluate reliability in the later stages of product development, but it is expensive to change and improve products at that time. is makes it important to ensure product reliability in the earlier design stage [4]. e relationship between the design and the performance is shown in Figure 1. In this paper, the vector x � (x 1 , . . . , x m ) represents the design points or design parameters [5] and the function h(x) describes the performance, and y denotes the output performance, and the performance specification [5] describes the performance requirement of products, represented by [y l , y u ]. e design space is defined by the lower and upper bounds, represented by x l � (x l 1 , . . . , x l m ) and x u � (x u 1 , . . . , x u m ), respectively. e feasible operating region [5] or feasible space [6] is the set of all possible points in the design space that satisfy the performance specification in the deterministic case. e set of all possible points in the design space that meet the reliability requirement in the probabilistic case is called the reliable operating region [7,8] or reliable design space [6]. e reliable operating region defined by the probabilistic case ought to be a subset of the feasible operating region, for which no uncertainty is considered [8,9]. An exact description of the reliable operating region is in general not simple, since it may be a very complex set [6].
Some efforts have been devoted to the reliability design [8][9][10][11][12][13], and the existing literature is mainly focused on how to find an optimum design point in the reliable operating region [6,[14][15][16]. Aiming to find the optimum design point while considering the impacts of uncertainties, a method based on the first-order reliability was proposed in [6], which converted the probabilistic constraints to approximate deterministic constraints without unduly sacrificing accuracy. A deterministic optimization method was presented to identify the optimum design points whose performances are equal to the target values within the reliable operating region in [14].
Apart from the optimum design point, engineers are also interested in the reliable operating region because it provides the permissible ranges for design parameters. However, the reliable operating region is irregularly shaped and inconvenient to use. It is desirable in engineering to build a space which is not only reliable but also easy to use.
We aim to seek a maximum reliable hyperrectangle operating region in which every design point satisfies the reliability requirement. ere are two main benefits from this hyperrectangle. First, it determines a relatively large permissible interval for each design parameter, so engineers can use low-precision equipment which helps to reduce the manufacturing cost. Second, it is such that design parameters are decoupled. For a design to be reliable, the choice of a design parameter value within its assigned interval does not depend on the values of the other design parameters as long as they are within their respective intervals.
In some approaches, hyperrectangles are identified with the aid of Monte Carlo sampling technique [17][18][19]. Cluster analysis in [19] was to compute hyperrectangles on the basis of one stochastic sample of design points. is approach is limited to problems with large design spaces or extremely large sample sizes. e stochastic algorithm proposed in [20] combined query and online learning, which probed a candidate hyperrectangle by stochastic sampling, and then readjusted its boundaries in order to, first, remove designs outside the feasible operating region and, second, explore more design space that had not been probed before. e quality of the results and the efficiency of this stochastic algorithm were studied in detail in [21].
is stochastic approach, however, produced a hyperrectangle that might contain some design points outside the feasible operating region and might not have the best size because Monte Carlo sampling was used to estimate the boundaries of the feasible operating region. e algorithm presented in [5], applied interval arithmetic within an iterative optimization scheme to decide whether the candidate hyperrectangle was contained in the feasible operating region. Interval arithmetic, however, limits the applicability of the algorithm because the accuracy of the results depends on the problem and cannot be assessed for general cases [22].
ere are several challenges associated with seeking the maximum hyperrectangle. First, because the reliable operating region is often irregularly shaped, we cannot solve this optimization problem directly. How to find a reliable hyperrectangle with the maximum volume, which is contained in the reliable operating region, is challenging. Second, the initial point of the reliable hyperrectangle is critical, but how to determine a reasonable initial point is difficult.
To address these challenges, firstly, we propose an iterative algorithm called the reliable hyperrectangle algorithm. is algorithm iteratively updates the lengths of the sides of the reliable hyperrectangle. Moreover, we prove the convergence of this algorithm under some conditions. Furthermore, the design point whose performance is approximately equal to its target value is suitable as the initial point.

The Reliable Hyperrectangle
As we point out in the introduction, the reliable operating region is determined by the performance function, the performance specification, and the reliability requirement. It is hard to describe the geometry shape of the reliable operating region and difficult to derive an explicit expression [23]. e lack of the explicit expression brings difficulty to the directly application of the reliable operating region in the practical engineering. is motivates us to find a reliable hyperrectangle operating region. Actually, because the rectangle-shaped operating region is characterized by simple structure, convenient operation, easy control, and powerful usability, it has been widely applied in other engineering problems [24]. For example, the hyperrectangle is used for concurrent design of vehicle tires and axles in [25] and is applied to some medical problems in [26]. e axis-parallel reliable hyperrectangle operating region is expressed as intervals for each design parameter. It has the advantage that design intervals for one design parameter are independent of the other design parameter values, that is, design parameters can be decoupled. e reliability requirement is satisfied as long as design parameters lie within their respective design intervals. Moreover, the intervals might be combined with intervals of other disciplines, thus their cross-sections are global reliable hyperrectangle. Additionally, maximum flexibility for the design is provided if the intervals are as large as possible.
e problem for solving the global minimum of a function in a hyperrectangle operating region has been studied [27][28][29][30]. Instead, this paper focuses on the inverse problem, that is, finding a maximum hyperrectangle operating region which enables the function to satisfy constraints.
In this section, we consider hyperrectangle design in two different cases. One is the deterministic case in which we assume there are no random errors among the manufacture or the effect of the errors is usually very small and can be neglected. e other is the probabilistic case in which we assume there exist random errors between the nominal performances and the output performances. e axis-parallel hyperrectangle is a product of intervals, that is, where I i � [x ll i , x uu i ] and x ll i and x uu i are the lower and upper boundaries of the hyperrectangle. As convenient, we group the lower boundaries, x ll i 's into a vector x ll and group the upper boundaries x uu i 's into a vector x uu , that is, x ll � (x ll 1 , . . . , x ll m ) and x uu � (x uu 1 , . . . , x uu m ).

Feasible Operating Region (Deterministic Case).
In the deterministic case, the relationship between the design point and the output performance is stated as that is, the uncertainty is not considered. We are looking for a maximum hyperrectangle, which has the advantage that whatever design point is selected in this hyperrectangle, it will comply with the performance specification. at is, we seek a maximum hyperrectangle contained in the feasible operating region. e problem of searching for a maximum hyperrectangle in the feasible operating region can be formulated as follows: where mdl x ll , x uu � min If the conditions mdl(x ll , x uu ) ≥ 0 and mdu(x ll , x uu ) ≥ 0 are satisfied, then for any x ∈ [x ll , x uu ], we have y l ≤ h(x) ≤ y u .
is implies that each design point in the hyperrectangle maintains the output performance within specified bounds.

Reliable Operating Region (Probabilistic Case).
Due to noise factors and manufacture errors, there exist some errors between the output performances and the nominal performances. Let ε represent the random error, then that is, uncertainty is considered. Notice that ε is a random error which is described by a statistical distribution type predetermined by engineers.
In this probabilistic case, the reliability can be calculated point by point as follows: where and F(·) is the cumulative distribution function of ε. e design point is considered reliable if its reliability is above a given threshold α. e reliable operating region is the set of all possible points in the design space whose reliabilities are above this given threshold.
Maximizing an axis-parallel hyperrectangle in which each design point can satisfy the reliability requirement, that is, seeking an axis-parallel maximum hyperrectangle in the reliable operating region, can be stated as the following optimization problem: where mp x ll , x uu � min If the condition mp(x ll , x uu ) ≥ 0 is satisfied, then for any is implies there is at least a 100α% probability that the obtained products are reliable as long as the design point is within the reliable hyperrectangle.
In order to verify whether the design point satisfies the reliability requirement, the Monte Carlo sampling technique is used. We sample some random errors from the predetermined distribution and calculate the coverage probability which is the proportion that the output performances lie within specified bounds. Notice that the output performance is given by equation (6), that is, the sum of the nominal performance and the random error. If the coverage probability is above the given reliability threshold, the reliability of the design point is considered to be validated.

The Reliable Hyperrectangle Algorithm
e optimization problems (3) and (9) cannot be directly solved, so an iterative method is used. In this section, we propose an iterative reliable hyperrectangle algorithm, which starts from an initial point x 0 � (x 01 , x 02 , . . . , x 0m ) to search out a maximum hyperrectangle in the reliable operating region. For some ϵ > 0, the condition mp(x 0 , x 0 ) ≥ ϵ is satisfied. We will present the selection strategy of the initial point x 0 in the remainder of this paper.
is section mainly presents how to use the proposed algorithm to solve problem (9). is algorithm can also be used to solve problem (3).

Algorithm Design.
e proposed iterative algorithm is called the reliable hyperrectangle algorithm. e basic idea is to adjust the boundaries of the hyperrectangle one-by-one until they cannot be extended any further. If an index i is selected, the hyperrectangle is updated by increasing an appropriate size in the ith design parameter while other design parameters are fixed. Assuming the index i is chosen in a cyclic manner from the set o � (o 1 , o 2 , . . . , o m ), which is a permutation of 1, 2, . . . , m.
More specifically, if an index i ∈ o is selected, an extension part of the hyperrectangle is expressed by the lower boundary l u i and the upper boundary . We first seek an appropriate size d which ensures the extension part of hyperrectangle is reliable, that is, the condition mp(l u i , u u i ) ≥ ϵ is satisfied. en, we set x uu i � x uu i + d. e upper boundary of the ith design parameter is updated. e step size d is determined by the following method. Given an initial step size d 0 , if the condition mp(l u i , u u i ) ≥ ϵ is satisfied, we accept this step. Otherwise, based on the dichotomy method, we find some d between 0 and d 0 such e lower boundary x ll is also updated in the same manner. For the selected index i, we use the method similar to that of updating the upper boundary to determine an appropriate step size d which subjects to mp(l us, we begin with an initial point x 0 and iteratively update the boundaries of each design parameter. e iteration is terminated, when each design parameter reaches the boundary of the reliable operating region. Note that we extend the boundaries of the hyperrectangle by a relatively small step size, especially when the performance function h(x) is multimodal. is setting has the advantage that the values of mp(l u i , u u i ) and mp(l l i , u l i ) calculated by the interior-point algorithm have a high possibility to be the global minimum of r(x) − α on the extended hyperrectangles [l u i , u u i ] and [l l i , u l i ], respectively, and thus ensures the obtained hyperrectangle is indeed contained in the reliable operating region. e order in which the updates of the design parameters are performed, however, may have an effect on the result. erefore, we use all possible permutations of 1, 2, . . . , m to give m! different orders, where m! is the factorial of the number m. In the outer loop, we loop over m! different orders (index t). In the inner loop, the boundaries of the hyperrectangle are adjusted one-by-one in order o t until they cannot be extended any further. us, we obtain m! hyperrectangles, and the one with the maximum volume is chosen as the resulting hyperrectangle.
A formal description of the reliable hyperrectangle algorithm, including some more details that are important to the following analysis of its convergence, is given in Figure 2.

Convergence Analysis.
In this section, we give the convergence analysis of the proposed algorithm under the assumption that the performance function h(x) is continuous. First, we have the following theorem, and the detailed proof is given in Supplementary Material (available here).

Theorem 1. mp(l u i , u u i ) is a single variable function of d and it is continuous for all d ≥ 0 under the assumption h(x) is continuous.
In the reliable hyper-rectangle algorithm, the outer loop loops over all m! different orders, therefore the convergence of algorithm is proved as long as the inner loop is terminated after finite iterations. In the inner loop, we conclude that the ith design parameter is removed from the index set I u if either of the following two conditions is satisfied. e first one is that it reaches the bounds of the design space. And the second one is that it reaches the boundary of reliability constraints.
We show that either of the two termination conditions is satisfied within finite iterations. From eorem 1, mp(l u i , u u i ) is a single variable function of d. Moreover, by the definitions of l u i and u u i , the value of mp(l u i , u u i ) at d � 0 is always greater than or equal to ϵ. If the value of mp(l u i , u u i ) at d � d 0 is below ϵ, then, due to the continuity of mp(l u i , u u i ), according to Intermediate Value eorem [31], there exist some points d between 0 and d 0 such that mp(l u i , u u i ) � ϵ. us, the second termination condition is met after finite iterations. Otherwise, the first termination condition is met after ( Similarly, the ith design parameter is removed from the index set I l after finite iterations. erefore, the convergence of the reliable hyperrectangle algorithm is guaranteed.

Optimality Analysis.
e order in which the updates of boundaries of design parameters are performed one-by-one, however, may have an effect on the result. To solve this problem to a certain degree, we use nested loops in the reliable hyperrectangle algorithm. e outer loop loops over all m! different orders. e inner loop updates the boundaries of the hyperrectangle one-by-one in order o t until they cannot be extended any further. us, the boundaries of the hyperrectangle obtained and the one with the maximum volume is chosen as the resulting hyper-rectangle. In this sense, the result of this algorithm is locally suboptimal.

Extensions.
In this section, we consider the extension of the proposed algorithm. First, we consider the extension of this algorithm to deal with multiple performances. We assume p performances are defined by where y � (y 1 , . . . , y p ), h(x) � (h 1 (x), . . . , h p (x)), and ε � (ε 1 , . . . , ε p ). Given performance specifications [y l , y u ], the equation r(x) in problem (9) can be rewritten as where f(·) is the joint probability density function of random errors. Next, we consider the extension of the proposed algorithm to deal with the design space constraints. We assume the design space is constrained by q inequalities, that is,  (9) can be formulated as follows: where mpg x ll , x uu � min mp x ll , x uu , mg x ll , x uu , mg x ll , x uu � min and mp(x ll , x uu ) is the same as that in equation (10). We can employ the reliable hyperrectangle algorithm to tackle this problem similarly.

Initial Point.
In the practical engineering application, engineering personnel's aim is to gain a maximum reliable hyperrectangle around the design points where the performances are equal to their target values, so it is appropriate to consider this design point as the initial point. However, there are usually multiple design points where the performances are equal to their target values. Some of those are near the boundary of the reliable operating region, while others are away from the boundary of the reliable operating region. e design point which sits near the boundary is unsuitable as initial point. Here, we use the tolerance design to reduce the size of the reliable operating region and obtain a design point which not only minimizes deviation between the performance and their target values but also sits away from the boundary of the original reliable operating region.
Tolerance design pays attention to how variations in design parameters are transmitted to the constraint functions [32]. In general, the maximum variation of design parameter i is denoted by Δx i . e effect of variations on a constraint function can be estimated from a first-order Taylor's series as follows: where Δg j represents the constraint variation transmitted to constraint function g j . If the value of Δx i is not given by engineers, then we set Δx i � (1/6)(x uu i − x ll i ). Tolerance design addresses both the feasibility robustness [32] and the reliability robustness [33]. Feasibility robustness can be developed by increasing the value of the constraint function during optimization by the amount of the constraint variation. Reliability robustness can be achieved by improving the threshold of reliability. erefore, the tolerance design model can be expressed as follows: where η is a given positive number. is constrained optimization problem can be solved by the common algorithms, such as interior-point method. e solution is used as the initial point of the reliable hyperrectangle, denoted by x 0 .
However, in the case where the target value of the performance is not given, it is reasonable to take the center point of the design space as the initial point if the center point is feasible and reliable.

Process of the Reliable Hyperrectangle Algorithm.
According to the abovementioned analysis, the steps of using the reliable hyperrectangle algorithm to design a reliable hyperrectangle can be described briefly as follows: Step 1: to set the parameters, the lower and upper bounds of the design space, x l and x u , and the initial step size d 0 are set for each problem individually. Additionally, here we set default parameters ϵ � 10 − 4 and d ϵ � 10 − 3 .
Step 2: to obtain the initial point, by means of the interior-point method to solve model (17), we obtain the initial point x 0 .
Step 3: to obtain the maximum hyperrectangle, by means of the reliable hyperrectangle algorithm shown in Figure 2, we obtain the desired hyperrectangle.

Numerical Examples and Comparisons
ere is recent literature on the same topic considering uncertainties [5,20,21]. erefore, for comparison purpose, certainties is not considered in this section, that is, we aim to find the maximum hyperrectangle in the feasible operating region. More specifically, two numerical examples in [21] are considered to compare the solution of the proposed algorithm with the solution of the method in [21] (we denote this method by "GHZ method" hereafter).
(1) In Example 1, the feasible operating region is constrained by a convex polytope in two dimensions (2) In Example 2, the feasible operating region is constrained by a tilted hyperplane which divides the l-dimensional unit cube into two equal volumes

Numerical Example 1: A Convex Polytope as Boundary.
Let x l = (0, 0) and x u = (0, 0) be the lower and upper bounds of the design space, respectively, and e particularity of this problem is that h i (x) is monotonous, thus, the set x ll , x uu : min is the same as the set where and T denotes the transpose of a matrix. erefore, the optimization problem (3) can be transformed into the following constrained optimization problem: is is a quadratic optimization problem under inequality constraints. e exact solution is found by means of Lagrange multipliers and is shown in the second row of Table 1.
e solution of the GHZ method and the result of this paper are also shown in the third and fourth rows of Table 1, respectively. e column entitled "Volume" contains the volume of hyperrectangle, and the column entitled ''Volume Error'' contains the relative error between the volume and the exact volume.
According to Table 1, the obtained hyperrectangle by our method is in close proximity to the exact result. It is easy to verify that all points in the obtained hyperrectangle are contained in the feasible operating region. Moreover, the operation time of our method is 14.68 seconds (using MATLAB R2016b software in a windows platform with Intel Core i7-4790 CPU 3.60 GHz, 8 cores, 8 GB RAM). For a small number of design parameters, the operation time of our method is less than that of the GHZ method, which uses the Monte Carlo sample simulating 100 times. e volume of hyperrectangle by our method is larger than that by the GHZ method, and volume error by our method is smaller than that by the GHZ method.

Numerical Example 2: A Tilted Hyperplane as Boundary.
We consider now an l-dimensional problem with a tilted hyperplane as boundary. e exact solution is computed and the algorithm's behavior for different l is studied.
Let us consider the l-dimensional unit cube [0, 1] l as the design space. e tilted hyperplane is described by the following equation: Its exact solution is given by x uu � [1/2, . . . , 1/2], and the exact hyperrectangle volume is 2 − l . For l � 2 and l � 3, the solutions of the GHZ method and the results of our method are shown in Tables 2 and 3, respectively.

Mathematical Problems in Engineering
According to Tables 2 and 3, the result by our method is in close proximity to the exact result, so it indicates that the proposed method is reasonable. Compared to the result by the GHZ method, our method has smaller volume errors. Moreover, all points in the hyperrectangle obtained by our method are contained in the feasible operating region; however, some points in the hyperrectangle obtained by the GHZ method are not included in the feasible operating region.
Overall, the proposed method has a low time complexity and performs well with small volume errors. Numerical examples show that our method has a better performance than the GHZ method and thus is a good approach for seeking out the maximum hyperrectangle.

Case Studies
In this section, with two engineering examples, the capability of our method to seek maximum hyperrectangle in the reliable operating region is illustrated. e first example indicates how our approach deals with multiple performances. e second example shows how our approach handles with a multimodal function.
Because the design parameters may have different units, we normalize each design parameter before applying our proposed approach. Moreover, engineers set normally the reliability threshold α � 0.95.

Case Example 1: e Planetary Gear.
ere are two main performances for the planetary gear: bending fatigue and contact fatigue [34]. e bending fatigue strength R 1 and bending stress S 1 have the following expressions [35]: respectively, where x 1 is bending fatigue limit stress of gear tooth (in N/mm 2 ), x 2 is life factor of the gear, x 3 is the tangential force on the inner part of the gear face (in N/mm 2 ), and x 4 is the tooth form factor. Similarly, the contact fatigue strength R 2 and contact stress S 2 can be expressed as follows [35]: respectively, where x 5 is the contact fatigue strength limit (in N/mm 2 ), x 6 is the lubricating factor, x 7 is the dynamic factor, and x 3 is the same as above. e bend fatigue y 1 and contact fatigue y 2 are two performances we consider. Performance functions for bend fatigue and contact fatigue are respectively. It is considered reliable, provided the following conditions hold: y 1 ≥ 1 and y 2 ≥ 1. at is, y l � (1, 1). Moreover, based on the safety margin, engineers set the target values of these two performances as y 0 � (y 01 , y 02 ) � (3,3). e second row of Table 4 shows the design space in terms of the bounds of each design parameter.
Besides, there are two constraints: the bending strength must be greater than 1200 N/mm 2 and the contact strength must be greater than 1600 N/mm 2 . erefore, constraint functions are expressed as e reliable hyperrectangle design is studied under the assumption that random errors exist and follow normal distribution. First, the tolerance model (17) is developed to get the initial point x 0 . Next, the problem of searching for a reliable hyperrectangle is transformed into problem (13), where mg x ll , x uu � min g 1 (x) and g 2 (x) are defined by equation (28), h(x) � (h 1 (x), h 2 (x)), 1 � (1, 1), ε � (ε 1 , ε 2 ) ∼ N(0, Σ), and     Table 4 in terms of the bounds of each design parameter. Monte Carlo sampling [36] is used to verify whether the obtained reliable hyperrectangle satisfies the reliability requirement in the presence of random errors. We firstly sample some design points which are randomly and uniformly distributed over the obtained reliable hyperrectangle, then sample 1000 random errors from the normal distribution N(0, Σ) finally compute the coverage probability of each sampled design point. e coverage probability is the proportion that output performances lie within the performance specifications, where the output performances are the sum of the nominal performances and random errors. Due to space restrictions, part of simulation results is shown in Table 5. For each sampled design point, its coverage probability is higher than the reliability threshold (0.95); therefore, its reliability is validated.

Case Example 2: Diamond Turning Process.
e surface roughness in the diamond turning process is shown in Figure 3. e waveform left on the finished surface is mainly due to the tool nose geometry and feed [37]. A performance function for the surface roughness with three design parameters is given by where x 1 , x 2 , and x 3 denote the feed in microns/revolution (μm/rev), the tool nose radius in microns (μm), and the minimum undeformed chip thickness in microns (μm), respectively. e output performance is expressed as where ε is the random error and follows the normal distribution with mean zero and unknown variance σ 2 . e random error comes from one measurement to the next. e random error tends to be normally distributed when it is the sum of many small and independent random errors because of the central limit theorem [38]. e target value of the output performance is 3.5 μm. e performance specification requires that y is between 2 and 5 μm. e second row of Table 6 shows the design space in terms of the bounds of each design parameter. e performance function (30) is developed based on some simplified assumptions and may be not accurate; thus, we use experiment data to improve the performance function. Figure 4 shows the experiment data from the microturning of an aluminium alloy using a diamond tool with nose radius of 800 microns and the minimum undeformed chip thickness of 0.02 microns [39]. We have 20 measured values of surface roughness at each of the experiment points and therefore can obtain an estimate of σ 2 . We obtain σ 2 � 0.2191. e estimate derived from the performance function and the experiment data can be computed as which is much larger than 0.2191. is shows that the performance function is not good.
We use the experiment data to adjust the performance function. Based on the plot of residuals from the performance function against x 1 , and after some experimentation, we choose μ 1 (x 1 ) � 1, μ 2 (x 1 ) � x 1 , and μ 3 (x 1 ) � log(1 + x 1 ).   us, the adjusted performance function for the surface roughness is given by In [40], an optimum design point was discussed and θ was estimated by the Bayesian approach. Our aim is to find a reliable operating region; thus, it is more appropriate to use frequentist procedures which are computationally efficient and simple to implement. Here, the maximum likelihood method is used to estimate the unknown parameters. e likelihood function is expressed as e maximum likelihood estimate of σ 2 is σ 2 � 0.2740, which is much smaller than that of the performance function (9.0563) and only slightly larger than σ 2 � 0.2191. is implies the adjusted performance function gives a good fit (see Figure 4). Now we can carry out the proposed algorithm based on the adjusted performance function, where σ is estimated by σ. e reliable hyperrectangle is listed in the third row of Table 6 in terms of the bounds of each design parameter.
We use the same method as that in Example 1 to simulate random errors and show part of results in Table 7. We see that coverage probabilities are higher than the reliability threshold (0.95). It is obvious that the adjusted performance function (33) is a multimodal function; therefore, the ability of the proposed algorithm in dealing with multimodal functions is confirmed.
Moreover, minimizing the deviation between the performance and its target, that is, min x ll ≤x≤x uu (y(x, θ) − y 0 ) 2 , is considered as the objective function to find the optimum point inside the proposed reliable design operating region. e obtained optimum point is (69.6664, 800.0171, 0.0173). We can see that the optimum point is close to the initial point.
Besides, we seek the permissible reliable range of x 1 under the condition that the values of x 2 and x 3 , as in the physical experiment shown in Figure 4, are fixed at 800 and 0.0200. e obtained reliable range is [5.0000, 91.6428]. We see that all but the last of those experiment points are included in this range.
is result agrees with the experiment because 5 of 20 measured surface roughness of the last experiment point are larger than the upper bound of surface roughness and therefore the last experiment point is unreliable.

Conclusions
is paper focuses on the design of the reliable hyperrectangle. An iterative algorithm which updates the sides of hyperrectangle one-by-one is proposed to search the reliable hyperrectangle. We have proven the convergence of the proposed algorithm. Moreover, we extend the proposed algorithm to deal with design space constraints. Besides, we have discussed how to determine the initial point. Numerical examples show that our method has a better performance than the GHZ method in [21]. Some engineering cases show that the proposed method can guarantee product reliability.
is has validated the effectiveness of our approach.
Data Availability e digital data supporting this article are from previously reported studies and datasets, which have been cited.

Conflicts of Interest
e authors declare no potential conflicts of interest with respect to the research, authorship, and/or publication of this article.