Application of Interval Predictor Model Into Model Predictive Control

In this paper, interval prediction model is studied for model predictive control (MPC) strategy with unknown but bounded noise. After introducing the family of models and some basic information, some computational results are presented to construct interval predictor model, using linear regression structure whose regression parameters are included in a sphere parameter set. A size measure is used to scale the average amplitude of the predictor interval, then one optimal model that minimizes this size measure is efficiently computed by solving a linear programming problem. The active set approach is applied to solve the linear programming problem, and based on these optimization variables, the predictor interval of the considered model with sphere parameter set can be directly constructed. As for choosing a fixed non-negative number in our given size measure, a better choice is proposed by using the Karush-Kuhn-Tucker (KKT) optimality conditions. In order to apply interval prediction model into model predictive control, the midpoint of that interval is substituted in a quadratic optimization problem with inequality constrained condition to obtain the optimal control input. After formulating it as a standard quadratic optimization and deriving its dual form, the Gauss-Seidel algorithm is applied to solve the dual problem and convergence of Gauss-Seidel algorithm is provided too. Finally simulation examples confirm our theoretical results.

Fuzzy Multi-objective Linear Programming Problem using DM's Perspective

In this paper, a two-stage method has been proposed for solving Fuzzy Multi-objective Linear Programming Problem (FMOLPP) with Interval Type-2 Triangular Fuzzy Numbers (IT2TFNs) as its coefficients. In the first stage of problem solving, the imprecise nature of the problem has been handled. All technological coefficients given by IT2TFNs are first converted to a closed interval and then the objectives are made crisp by reducing a closed interval into a crisp number and constraints are made crisp by using the concept of acceptability index. The amount by which a specific constraint can be relaxed is decided by the decision maker and thus the problem reduces to a crisp multi-objective linear programming problem (MOLPP). In the second stage of problem solving, the multi-objective nature of the problem is handled by using fuzzy mathematical programming approach. In order to explain the methodology, two numerical examples of the proposed methodology in Production planning and Diet planning problems have also been worked out in this paper.

Application of Water Cycle algorithm to Stochastic Fractional Programming Problem

This paper presents an application of Water Cycle algorithm (WCA) in solving stochastic programming problems. In particular, Linear stochastic fractional programming problems are considered which are solved by WCA and solutions are compared with Particle Swarm Optimization, Differential Evolution, and Whale Optimization Algorithm and the results from literature. The constraints are handled by converting constrained optimization problem into an unconstrained optimization problem using Augmented Lagrangian Method. Further, a fractional stochastic transportation problem is examined as an application of the stochastic fractional programming problem. In terms of efficiency of algorithms and the ability to find optimal solutions, WCA gives highly significant results in comparison with the other metaheuristic algorithms and the quoted results in the literature which demonstrates that WCA algorithm has 100% convergence in all the problems. Moreover, non-parametric hypothesis tests are performed and which indicates that WCA presents better results as compare to the other algorithms.

Optimality and duality for complex multi-objective programming

<p style='text-indent:20px;'>We consider a complex multi-objective programming problem (CMP). In order to establish the optimality conditions of problem (CMP), we introduce several properties of optimal efficient solutions and scalarization techniques. Furthermore, a certain parametric dual model is discussed, and their duality theorems are proved.</p>

Application of Water Cycle algorithm to Stochastic Fractional Programming Problem

This paper presents an application of Water Cycle algorithm (WCA) in solving stochastic programming problems. In particular, Linear stochastic fractional programming problems are considered which are solved by WCA and solutions are compared with Particle Swarm Optimization, Differential Evolution, and Whale Optimization Algorithm and the results from literature. The constraints are handled by converting constrained optimization problem into an unconstrained optimization problem using Augmented Lagrangian Method. Further, a fractional stochastic transportation problem is examined as an application of the stochastic fractional programming problem. In terms of efficiency of algorithms and the ability to find optimal solutions, WCA gives highly significant results in comparison with the other metaheuristic algorithms and the quoted results in the literature which demonstrates that WCA algorithm has 100% convergence in all the problems. Moreover, non-parametric hypothesis tests are performed and which indicates that WCA presents better results as compare to the other algorithms.

An interior-point trust-region algorithm to solve a nonlinear bilevel programming problem

<abstract><p>In this paper, a nonlinear bilevel programming (NBLP) problem is transformed into an equivalent smooth single objective nonlinear programming (SONP) problem utilized slack variable with a Karush-Kuhn-Tucker (KKT) condition. To solve the equivalent smooth SONP problem effectively, an interior-point Newton's method with Das scaling matrix is used. This method is locally method and to guarantee convergence from any starting point, a trust-region strategy is used. The proposed algorithm is proved to be stable and capable of generating approximal optimal solution to the nonlinear bilevel programming problem.</p> <p>A global convergence theory of the proposed algorithm is introduced and applications to mathematical programs with equilibrium constraints are given to clarify the effectiveness of the proposed approach.</p></abstract>