A practicable branch and bound algorithm for sum of linear ratios problem

In this paper, a branch and bound approach is proposed for global optimization problem (P) of the sum of generalized polynomial fractional functions under generalized polynomial constraints, which arises in various practical problems. Due to its intrinsic difficulty, less work has been devoted to globally solving this problem. By utilizing an equivalent problem and some linear underestimating approximations, a linear relaxation programming problem of the equivalent form is obtained. Consequently, the initial non-convex nonlinear problem (P) is reduced to a sequence of linear programming problems through successively refining the feasible region of linear relaxation problem. The proposed algorithm is convergent to the global minimum of the primal problem by means of the solutions to a series of linear programming problems. Numerical results show that the proposed algorithm is feasible and can successfully be used to solve the present problem (P).

This article addresses a special class of non-linear programming problems, viz., linear fractional programming problems having multiple objectives. In solving the real-life linear fractional optimization problems, the ambiguity and hesitation in the decision are inherent and ever-present, therefore, it is perfectly viable to formulate and solve these optimization models using the intuitionistic fuzzy environment. The purpose of this study is to propose a simple and computationally efficient approach to obtain the solution of multiple objective linear fractional programming problems having all the decision variables and parameters expressed in terms of triangular intuitionistic fuzzy numbers. The proposed solution algorithm is primarily based on the goal programming approach, fuzzy-based linearization technique, and a membership function strategy. The original linear fractional programming problem is first converted to its equivalent deterministic/crisp multi-objective linear fractional optimization problem using the weighted goal programming methodology along with the linear membership technique to resolve the intuitionistic fuzzy constraints into the crisp one. Finally, the variable transformation technique for the under- and over-deviational variables of the goal programming model is employed to linearize all the fractions involved in the problem so as to convert the original problem to an equivalent linear optimization problem. Further, this linear programming problem can be solved using any available commercial packages. Moreover, a numerical illustration is provided to demonstrate the steps of the proposed technique followed by the analysis and solution of an E-education set-up problem. The discussion and comparisons of the practical case establish the relevancy and usefulness of the proposed model.

Prestack amplitude versus offset (AVO) inversion is an essential tool to estimate elastic properties. Approximations of P-wave reflection coefficients based on the Zoeppritz equation are limited by the assumption of weak contrast and are inaccurate for far offset, and the existing nonlinear inversion method, like ant colony optimization (ACO), cannot converge to the global optimal solution within a limited time. Consequently, we propose a nonlinear AVO inversion method based on the exact Zoeppritz equation using hybrid quantum ant colony optimization (HQACO). The Zoeppritz equation is a forward modeling approach with high accuracy at far offset and is valid at the strong-contrast interface. HQACO, as a global optimization algorithm, not only has the potential of ACO to search global solutions but also exploits the power of quantum computing to speed up optimization procedures. The self-adaptive rotating strategy is proposed to improve the flexibility and efficiency of the conventional quantum rotating gate largely. Moreover, the quantum gate is introduced to enhance the global search ability. Numerical results show that the average evaluation number required for the global solution decreases largely and the solution converges to the global optimal solution closely using the proposed method. Synthetic applications verify that HQACO shows the most reliable exploring competence to find the global solution. The new inversion method is not only suitable for the strong-contrast interface with noise but also shows promising accuracy using the wide offset range.

The fuzzy set theory is being applied massively in many fields these days. One of these is linear programming problems. Kheirfam and Hasani (Sensitivity analysis for fuzzy linear programming problems with fuzzy variables, Advanced Modeling and Optimization, 12 (2010) 257-272), proposed a method for the sensitivity analysis for fuzzy linear programming (FLP) problems with fuzzy variables. There are some important cases that are not considered by Kheirfam and Hasani. In this paper, those cases are considered and numerical examples are solved.

Multiplicative problems are a kind of difficult global optimization problems known to be NP-hard. At the same time, these problems have some important applications in engineering, system, finance, economics, and other fields. In this paper, an optimization method is proposed to globally solve a class of multiplicative problems with coefficients. Firstly, by utilizing equivalent transformation and linearization method, a linear relaxation programming problem is established. Secondly, by using branch and bound technique, a determined algorithm is proposed for solving equivalent problem. Finally, the proposed algorithm is convergent to the global optimal solution of original problem by means of the subsequent solutions of a series of linear programming problems.

A deterministic global optimization algorithm for generalized geometric programming

In this paper, a method is developed to derive the acceptable ranges of objective values for a multi-objective linear fractional programming problem(MOLFPP) with fuzzy parameters both in objectives and constraints. \(\alpha \)- and \(\beta \)-cuts are respectively used in the objectives and constraints to specify the degrees of satisfaction and transform the fuzzy parameters into closed intervals. Using variable transformation and Taylor series expansion, the interval-valued fractional objectives are approximated by intervals of linear functions. The objective functions are assigned proper weights using analytic hierarchy process. Weighting sum method is used to transform the interval-valued multiple objectives into single objective. MOLFPP in interval-valued form is equivalently formulated as two linear problems which derive the acceptable ranges of objective values. Two numerical examples are illustrated to demonstrate the proposed method.

Since there were few chaotic neural networks applicable to the global optimization, in this paper, we propose a new neural network model — chaotic parameters disturbance annealing (CPDA) network, which is superior to other existing neural networks, genetic algorithms, and simulated annealing algorithms in global optimization. In the present CPDA network, we add some chaotic parameters in the energy function, which make the Hopfield neural network escape from the attraction of a local minimal solution and with the parameter annealing, our model will converge to the global optimal solutions quickly and steadily. The converge ability and other characters are also analyzed in this paper. The benchmark examples show the present CPDA neural network's merits in nonlinear global optimization.

Computer analysis and simulation based design optimization requires more computationally efficient global optimization tools. In this work, a new global optimization algorithm based on design experiments, region elimination and response surface model, namely Approximated Unimodal Region Elimination Method (AUREM), is introduced. The approach divides the field of interest into several unimodal regions using design experiment data; identify and rank the regions that most likely contain the global minimum; form a response surface model with additional design experiment data over the most promising region; identify its minimum, remove this processed region, and move to the next most promising region. By avoiding redundant searches, the approach identifies the global optimum with reduced number of objective function evaluations and computation effort. The new algorithm was tested using a variety of benchmark global optimization problems and compared with several widely used global optimization algorithms. The experiments results present comparable search accuracy and superior computation efficiency, making the new algorithm an ideal tool for computer analysis and simulation black-box based global design optimization.

This paper presents new linear programming techniques for the design of optimal 1D IIR digital filters. the first method is based on a linear minimax criterion and leads to a linear programming approximation problem whose optimal solution is attained by a new fast algorithm. Next, the linear minimax approximation problem is extended and formulated as two linear integer programming problems which permit the design of 1D IIR digital filters with coefficients of finite word length. the first of these methods is formulated as a 0‐1 integer linear programming problem and its optimal solution is attained rapidly by a new algorithm. This method appears to be suitable for the design of high‐order digital filters. the second method is more general and is formulated as a mixed integer linear programming problem. to solve the design problem efficiently, a new integer tree search algorithm is introduced. the feasibility of the proposed algorithms is illustrated with detailed solutions or numerical examples.

Fully intuitionistic fuzzy multi-level linear fractional programming problem

Many real-life optimization problems often face an increased rank of nonsmoothness (many local minima) which could prevent a search algorithm from moving toward the global solution. Evolution-based algorithms try to deal with this issue. The algorithm proposed in this paper is called GAAPI and is a hybridization between two optimization techniques: a special class of ant colony optimization for continuous domains entitled API and a genetic algorithm (GA). The algorithm adopts the downhill behavior of API (a key characteristic of optimization algorithms) and the good spreading in the solution space of the GA. A probabilistic approach and an empirical comparison study are presented to prove the convergence of the proposed method in solving different classes of complex global continuous optimization problems. Numerical results are reported and compared to the existing results in the literature to validate the feasibility and the effectiveness of the proposed method. The proposed algorithm is shown to be effective and efficient for most of the test functions.

<div class="section abstract"><div class="htmlview paragraph">Plenum system of automotive vehicles draws atmospheric air using HVAC blower motor through air inlet grille at the bottom of the windshield and uses lower plenum for rainwater drainage after which air flow enters into awning and sugar scoop for evaporator air flow requirement. Awning and sugar scoop component is used in plenum air flow system to ensure the air flow with the required velocity that would meet the performance metric of total pressure drop of plenum air flow system. The optimal design of plenum component is essential since blower motor energy needs to be drawn from the expensive battery pack and any wastage of energy would lead to reduction in range of the Electric Vehicle. The conventional design process utilizes incremental design iteration, engineering intuition and requires significant effort from engineers to meet performance targets within the specified design space. This also may or may not ensure an optimal design.</div><div class="htmlview paragraph">In this work, a Machine learning tool with extreme gradient boost algorithm is used for development of a robust meta model that is used for quick prediction of awning and sugar scoop performance parameters such as total pressure drop and velocity of air prediction. On this response surface, application of a meta heuristic [<span class="xref">1</span>] based global optimization method is demonstrated which uses simplex homological global optimization (SHGO) and differential evolutionary (DE) method for optimum awning and sugar scoop design. Simplex homological global optimization (SHGO) is the concept of homology group growth which is used to solve a global and derivative free optimization problem of arbitrarily high dimensions. Similarly Differential evolution (DE) is a population-based metaheuristic search algorithm [<span class="xref">2</span>] that optimizes a problem which can quickly explore very large design spaces. Using these global optimization algorithms, it is observed that the optimized design of the awning and sugar scoop does result in significant reduction of total pressure drop that helps improve the required performance substantially compared to baseline design parameters within the given design space.</div></div>

Abstract: Inversion of self-potential anomaly for 2-D inclined sheets of infinite horizontal extent has been studied. Least-square inversion and very fast simulated annealing global optimization has been used to model the five parameters of self potential anomaly. The method of least square and very fast simulated annealing global optimization method is compared and analyzed. Very fast simulated annealing can model the noisy and field data of self potential anomaly very precisely than linear inversion technique. However, time taken by very fast simulated annealing inversion is larger than linearized inversion. The comparative analysis has been done on synthetic data (noise free and noisy) and two field data from Bavarian woods anomaly, Germany and Surda anomaly, India to show the efficacy of both the methods. The estimated parameters were compared with those from previous studies using various global optimization algorithms, mainly neural network, genetic algorithm and particle swarm optimization on the same field data sets. It can be concluded that the global optimization algorithms considered in this study were able to yield compatible solutions with those from least-square methods. The present global optimization method is in good agreement with the other global optimization methods in terms of results and computation time.

Solving word problems in linear programming presents significant challenges, not only for secondary school students but also for pre-service mathematics teachers. This study aims to investigate the cognitive processes of pre-service mathematics teachers in solving word problems related to linear programming. To achieve this objective, a comprehensive review of mathematics textbooks designed for pre-service teachers and secondary school students, as well as the corresponding curriculum, was conducted to identify an appropriate learning sequence for this topic. Subsequently, key problems were selected to facilitate learning, and predictions regarding the cognitive processes involved in solving these problems were formulated based on Newman’s error analysis framework. Following this preparatory phase, an individual written assessment was administered to 27 pre-service mathematics teachers to examine their problem-solving approaches in linear programming word problems. The findings of this study include the identification of essential word problems in linear programming and a comparative analysis between the predicted and actual problem-solving processes exhibited by the participants. In conclusion, this study highlights the potential of cognitive process predictions in anticipating learning difficulties and informing instructional strategies. These insights can be leveraged to provide targeted support for pre-service teachers facing challenges in problem-solving and to develop pedagogical interventions aimed at enhancing their problem-solving skills.