M. A. Yaghoobi
Department of Applied Mathematics, Faculty of Mathematics and Computer, Shahid Bahonar University of Kerman, Kerman, Iran.
[ 1 ] - Solving multiobjective linear programming problems using ball center of polytopes
Here, we aim to develop a new algorithm for solving a multiobjective linear programming problem. The algorithm is to obtain a solution which approximately meets the decision maker's preferences. It is proved that the proposed algorithm always converges to a weak efficient solution and at times converges to an efficient solution. Numerical examples and a simulation study are used to illu...
[ 2 ] - تأثیر‌پذیری فعالیت‌های عمده‌ی اقتصادی از اجرای همزمان اهداف اسناد بالا‌دستی در ایران (رویکرد تحلیل داده – ستانده با مدل برنامهریزی آرمانی چندهدفه)
امروزه سیاستمداران و برنامهریزان اقتصادی به دنبال برقراری چندین هدف بهطور همزمان، مانند برقراری توسعهی پایدار با اهداف اقتصادی، اجتماعی، زیستمحیطی و انرژی هستند ، در این صورت به ابزاری تحلیلی نیاز دارند تا بتوانند مسائل را از ابعاد مختلف ارزیابی کنند. این مقاله برای اولین بار با ترکیب تحلیل داده – ستانده با مدل برنامهریزی آرمانی چندهدفه به ارائهی مدلی جهت تحلیل آثار اجرای همزمان ا...
[ 3 ] - Approximating the step change point of the process fraction non conforming using genetic algorithm to optimize the likelihood function
Control charts are standard statistical process control (SPC) tools for detecting assignable causes. These charts trigger a signal when a process gets out of control but they do not indicate when the process change has begun. Identifying the real time of the change in the process, called the change point, is very important for eliminating the source(s) of the change. Knowing when a process has ...
[ 4 ] - A Class of Nested Iteration Schemes for Generalized Coupled Sylvester Matrix Equation
Global Krylov subspace methods are the most efficient and robust methods to solve generalized coupled Sylvester matrix equation. In this paper, we propose the nested splitting conjugate gradient process for solving this equation. This method has inner and outer iterations, which employs the generalized conjugate gradient method as an inner iteration to approximate each outer iterate, while each...
Co-Authors