Global optimization for the sum of generalized polynomial fractional functions

Global optimization of signomial geometric programming using linear relaxation

This work presents the solution based on the augmenting sequence of linear programming problems (LPP) as a tool for intellectualizing home environment. The proposed solution empowers the intelligent decision making procedure which can be applied to various intelligent control applications. The augmenting self-training procedure based on LPP approach is presented as well, which allows making reasonable decisions having only limited data about the controlled environment. The method permits retraining the decision making system when new data is available. As a proof of concept, this solution is applied to intelligent light control application. The obtained simulation results show the method’s capability in making reasonable decisions according to users preferences. DOI: http://dx.doi.org/10.5755/j01.itc.44.2.10235

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.

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

This paper proposes an effective separable relaxation algorithm to address the challenges associated with the sum of linear ratios problem (SLRP), which is characterized by a large number of ratios and low-dimensional variables. First, by introducing auxiliary variables and applying equivalent transformations, the equivalent problem (EP) corresponding to the SLRP is derived. Subsequently, using an innovative linearization technique, the relaxation problem (LRP) of the (EP) is formulated, demonstrating separable properties. Within this framework, solving a sequence of linear programming problems is sufficient to obtain a globally optimal solution to the (SLRP), significantly reducing computational effort. Furthermore, the paper provides a rigorous proof of the convergence properties of the proposed algorithm and estimates the maximum number of iterations required. Numerical experiments are conducted to validate the practicality and efficiency of the proposed algorithm.

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.

A deterministic global optimization algorithm for generalized geometric programming

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.

Fully intuitionistic fuzzy multi-level linear fractional programming problem

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.

In this paper, we propose a new model for linear fractional programming problem with absolute value functions. The major contribution of this paper is that transformation of linear fractional programming problem into separate linear programming problems with some theorems and then solution of these problems by popular algorithm. This work also used to simplex type algorithms to arrive at an optimal solution for a linear programming problem with absolute value. Moreover, we compare this method with an existing method. Numerical experiments are also given to illustrate the assertions.

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.

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.

This article provides a unified framework for studying the identification of counterfactual parameters in a general class of discrete outcome models, allowing for endogenous regressors and multidimensional latent variables, all without parametric distributional assumptions. Our main theoretical result is that, when the covariates are discrete, the infinite-dimensional latent variable distribution can be replaced with a finite-dimensional version that is equivalent from an identification perspective. The finite-dimensional latent variable distribution is constructed in practice by enumerating regions of the latent variable space with a new and efficient cell enumeration algorithm for hyperplane arrangements. We then show that bounds on a certain class of counterfactual parameters can be computed by solving a sequence of linear programming problems, and show how the researcher can introduce additional assumptions as constraints in the linear programmes. Finally, we apply the method to a mobile phone choice example with heterogeneous choice sets, and to an airline entry game example.

The use of iterative linear programming in practical applications of animal diet formulation