On Solving Bi-level Multi-Objective Fully Quadratic Fractional Optimization Model with Fuzzy Demands

This paper has been designed to introduce the method for solving the Bi-level Multi-objective (BL-MO) Fully Quadratic Fractional Optimization Model through Fuzzy Goal Programming (FGP) approach by utilising non-linear programming. In Fully Quadratic Fractional Optimization Model, the objective functions are in fractional form, having quadratic functions in both numerator and denominator subject to quadratic constraints set. The motive behind this paper is to provide a solution to solve the BL-MO optimization model in which number of decision-makers (DM) exists at two levels in the hierarchy. First, the fractional functions with fuzzy demand, which are in the form of fuzzy numbers, are converted into crisp models by applying the concept of α-cuts. After that, membership functions are developed which are corresponding to each decision-maker’s objective and converted into simpler form to avoid complications due to calculations. Finally, the model is simplified by applying FGP approach, and a compromised solution to the initial model is obtained. An algorithm, flowchart and example are also given at the end to explain the study of the proposed model.

On duality theory for multiobjective semi-infinite fractional optimization model using higher order convexity.

In the article, a semi-infinite fractional optimization model having multiple objectives is first formulated. Due to the presence of support functions in each numerator and denominator with constraints, the model so constructed is also non-smooth. Further, three different types of dual models viz Mond -Weir, Wolfe and Schaible are presented and then usual duality results are proved using higher-order [[EQUATION]] convexity assumptions. To show the existence of such generalized convex functions, a nontrivial example has also been exemplified. Moreover, numerical examples have been illustrated at suitable places to justify various results presented in the paper. The formulation and duality results discussed also generalize the well known results appeared in the literature.

A Mixed-Integer Fractional Optimization Approach to Best Subset Selection

We consider the best subset selection problem in linear regression—that is, finding a parsimonious subset of the regression variables that provides the best fit to the data according to some predefined criterion. We are primarily concerned with alternatives to cross-validation methods that do not require data partitioning and involve a range of information criteria extensively studied in the statistical literature. We show that the problem of interest can be modeled using fractional mixed-integer optimization, which can be tackled by leveraging recent advances in modern optimization solvers. The proposed algorithms involve solving a sequence of mixed-integer quadratic optimization problems (or their convexifications) and can be implemented with off-the-shelf solvers. We report encouraging results in our computational experiments, with respect to both the optimization and statistical performance. Summary of Contribution: This paper considers feature selection problems with information criteria. We show that by adopting a fractional optimization perspective (a well-known field in nonlinear optimization and operations research), it is possible to leverage recent advances in mixed-integer quadratic optimization technology to tackle traditional statistical problems long considered intractable. We present extensive computational experiments, with both synthetic and real data, illustrating that the new fractional optimization approach is orders of magnitude faster than existing approaches in the literature.