Algorithmic approach to fuzzy sequential linear and nonlinear programming problems

Abstract

Most of the gradient-based numerical methods for constrained newlinenonlinear optimization problems are specific and also involve the newlineimplementation of complicated algorithms. Many methods attempt to newlineovercome such drawbacks by incorporating linear programming with the newlinesolution process of the original nonlinear problem. The solution of the newlineoriginal problem is found by solving a series of linear programming sub newlineproblems. Each linear programming sub problem is formed by linearizing the newlineoriginal nonlinear objective and constraint functions. This linearization is newlinemade using the first order Taylor series expansion of the functions with newlinerespect to a design vector. Such a procedure, where linear programming is newlineused at each iteration to compute design changes, is called the Sequential newlineLinear Programming method. newlineThe Sequential Linear Programming problem is a well-known newlinemathematical programming and it has been studied by many Researchers. It newlinehas its wide applications in engineering, economics, and many other newlinescientific fields. The Sequential Linear Programming problem method is newlineconceptually as well as computationally quite simple, straightforward and newlineone of the most powerful methods for solving nonlinear optimization newlineproblems. The sequential linear programming problems along with newlineconstraints can be developed within the fuzzy set theory. The coefficients are newlinerepresented by triangular fuzzy numbers and Hexagonal fuzzy numbers. newline

Description

Keywords

Citation

item.page.endorsement

item.page.review

item.page.supplemented

item.page.referenced