Dr. Hussein Ali Hussein Al-Dallal Al-Saeedi | University of Babylon (original) (raw)

Uploads

Papers by Dr. Hussein Ali Hussein Al-Dallal Al-Saeedi

Research paper thumbnail of A New Technique for Finding the Optimal Solution to Assignment Problems with Maximization Objective Function

Journal of Physics: Conference Series, 2021

The assignment problems (AP) are an important part of linear programming problems (LPP) that deal... more The assignment problems (AP) are an important part of linear programming problems (LPP) that deal with the allocation of different resources for different activities based on one to one. The assignment problem is established in a variety positions when decision makers need to determine the optimal allocation and this means assigning only one task to one person to achieve maximum profits or imports or achieve less time or less cost based on the type of problem. In this work, a new technique has been provided to find an optimal solution for the assignment problems of maximization objective function. Comparing the proposed technique results with the Hungarian method indicates that the new technique has easier and less steps to find the optimal solution and thus the time is reduced and the effort is largely reduced.

Research paper thumbnail of A New Line Search Method to Solve the Nonlinear Systems of Monotone Equations

Journal of Engineering and Applied Sciences, 2019

Research paper thumbnail of A new technique to solve the maximization of the transportation problems

INTERNATIONAL CONFERENCE OF COMPUTATIONAL METHODS IN SCIENCES AND ENGINEERING ICCMSE 2021

Research paper thumbnail of Two New Effective Methods to Find the Optimal Solution for the Assignment Problems

Journal of Advanced Research in Dynamical and Control Systems, 2020

Research paper thumbnail of Solving a Large-Scale Nonlinear System of Monotone Equations by using a Projection Technique

Journal of Engineering and Applied Sciences, 2019

In this study, we suggest a new projection algorithm for solving nonlinear systems of monotone eq... more In this study, we suggest a new projection algorithm for solving nonlinear systems of monotone equations. The projection methods are an efficient family of derivative free methods for solving nonlinear systems of monotone equation that is in each iteration, the current iterate is strictly separated from the solution set of the problem by an appropriate hyperplane that constructs by the new projection algorithm. Then the current iterate is projected onto this hyperplane to determine the new approximation. Under standard assumptions, the global convergence of the proposed algorithm are proved. The numerical experiments indicate the efficiency of the proposed algorithm.

Research paper thumbnail of A New Technique to Solve the Maximization of the Transportation Problems

One of the most important linear programming applications in operations research (OR) is the tran... more One of the most important linear programming applications in operations research (OR) is the transportation problems (TP) formulation and solution as a linear programming problem (LPP) which is related to daily activities in our real life and mainly deals with logistics. The objective of this work is to introduce a new technique for solving (TP) that has an objective function of the type of maximization. This new technique was obtained by adding an important step to the method for finding the initial solution (IS) for the (TP) that has an objective function of the type of miniaturization that was proposed previously by Hussein, H. A. et al. This proposed new technique solves both of balanced and unbalanced (TP), it includes easy solution steps in terms of understanding and application, as well as achieving the results of the optimal or near the optimal solution (OS), thus saving a lot of time and effort when using it to solve these problems. By comparing the new technique with the three classical methods, NorthWest corner method (NWCM), least cost method (LCM), and Vogel's Approximation Method (VAM), the (IS) obtained by the new technique is better than the three methods in general. Furthermore the new technique is characterized by the ease, simplicity and speed of implementation the steps compared with the other three methods.

Research paper thumbnail of A New Revised Efficient of VAM to Find the Initial Solution for the Transportation Problem

Journal of Physics: Conference Series, 2020

Transportation Problem (TP) is a very important problem which has been vastly studied in Operatio... more Transportation Problem (TP) is a very important problem which has been vastly studied in Operations Research domain. There are some classical methods to find the initial basic feasible solution (IBFS) which minimize the total shipping cost of (TP) such as north-west corner method (NWCM), minimum cost method (MCM) and Vogel’s approximation method (VAM) which the best one of them. In this paper, we suggest a new amendment to (VAM) to find (IBFS) of (TP), which is an iterative method and the results will be near the optimal solution and in some cases equal to the optimal solution. In the numerical experiences we compare the results of the new approach with other classical methods to verify the efficiency of the new method. The proposed method is very effective and well-suited for use in solving these problems of various sizes.

Research paper thumbnail of A Modification to Vogel’s Approximation Method to Solve Transportation Problems

Journal of Physics: Conference Series, 2020

Transportation Problem (TP) is singular of the paradigms in the Linear Programming Problems (LPP)... more Transportation Problem (TP) is singular of the paradigms in the Linear Programming Problems (LPP). The TP in Operations Research represent vastly applied optimization. (TP) has some goals, like reducing transportation costs or reducing transportation time, etc. Whereas meeting both supply level and request level requirements. Transportation problem plays a major role in industry, trade, logistics, etc. To get the most possible profit, organizations are always looking for better ways to reduce cost and improve revenue. To solve the transportation problems, it is always required to find an initial basic feasible solution (IBFS) for get the optimal solution. The Vogel’s Approximation Method (VAM) is the important known traditional methods for obtaining an IBFS of TP. In this work, we introduce a new modification to the VAM for finding an IBFS for the transportation problems almost nearer to the optimal solve. Proposed modification is illustrated with solved numerical examples. A compar...

Research paper thumbnail of A New Technique for Finding the Optimal Solution to Assignment Problems with Maximization Objective Function

IOP Publishing, 2021

The assignment problems (AP) are an important part of linear programming problems (LPP) that deal... more The assignment problems (AP) are an important part of linear programming problems (LPP) that deal with the allocation of different resources for different activities based on one to one. The assignment problem is established in a variety positions when decision makers need to determine the optimal allocation and this means assigning only one task to one person to achieve maximum profits or imports or achieve less time or less cost based on the type of problem. In this work, a new technique has been provided to find an optimal solution for the assignment problems of maximization objective function. Comparing the proposed technique results with the Hungarian method indicates that the new technique has easier and less steps to find the optimal solution and thus the time is reduced and the effort is largely reduced.

Research paper thumbnail of New Technique for Finding the Maximization to Transportation Problems

IOP Publishing, 2021

Transportation problems (TP) are one of the important problems in linear programming problems (LP... more Transportation problems (TP) are one of the important problems in linear programming problems (LPP) that generally address the problems of transporting and distributing goods with the aim of achieving the largest profit or the lowest cost depending on the type of problem addressed. In this research study, a new technique was proposed to solve transportation problems with an objective function of the type of maximization that is used to achieve the highest possible profit. This technique was obtained by relying on a published research paper that deals with the same problem but with an objective function of the miniaturization type. The efficiency of this new technique was tested in terms of the type of results obtained when it was used to solve many transportation problems in life, and some of them were mentioned in this paper. After that, the solution results were compared using the proposed technique with the use of the three well-known classical methods which are NWCM, LCM, and VAM. Whereas, the results using the new technique were the required results that represent the optimal solution or close to the optimal solution.

Research paper thumbnail of Solving Systems of Nonlinear Monotone Equations by Using a New Projection Approach

IOP Publishing, 2021

The projection technique is one of the famous method and highly useful to solve the optimization ... more The projection technique is one of the famous method and highly useful to solve the optimization problems and nonlinear systems of equations. In this work, a new projection approach for solving systems of nonlinear monotone equation is proposed combining with the conjugate gradient direction because of their low storage. The new algorithm can be used to solve the large-scale nonlinear systems of equations and satisfy the sufficient descent condition. The new algorithm generates appropriate direction then employs a good line search along this direction to reach a new point. If this point solves the problem then the algorithm stops, otherwise, it constructs a suitable hyperplane that strictly separate the current point from the solution set. The next iteration is obtained by projection the new point onto the separating hyperplane. We proved that the line search of the new projection algorithm is well defined. Furthermore, we established the global convergence under some mild conditions. The numerical experiment indicates that the new method is effective and very well.

Research paper thumbnail of A New Modified TR Algorithm with Adaptive Radius to Solve a Nonlinear Systems of Equations

IOP Publishing, 2021

The trust region method (TRM) is a very important technique to solve both of linear and nonlinear... more The trust region method (TRM) is a very important technique to solve both of linear and nonlinear systems of equations. In this work, a new modified algorithm of a TRM with adaptive radius is introduced in purpose of solving systems of nonlinear equations. At each iteration, the new algorithm changes the trust region radius (TRR) automatically to reduce the subproblems resolving number when the current radius is rejected. The global convergence results of the new procedure under some appropriate conditions is established. The numerical effects indicate that the suggested algorithm is interesting and robustness.

Research paper thumbnail of Two New Effective Methods to Find the Optimal Solution for the Assignment Problems

Assignment problem (AP) is one of the main optimization problems, itis a private type of transpor... more Assignment problem (AP) is one of the main optimization problems, itis a private type of transportation problem (TP) in which every origin must have the ability to meet the request of any destination, i.e. any worker must be able to perform any job. The assignment problem is used to find one for one among a group of workers each of whom specializes for a specific job among a set of jobs, the main goal is to reduce gross cost (or reduce gross time) according to user requirements. This paper introduces two new methods (Al-Saeedi's 1st M. and Al-Saeedi's 2nd M.) to find a solution to the assignment problem. Moreover, some numerical examples were given to compare the results of the solution of the two new methods with the result of the solution of the Hungarian method. The two new methods are a systematic procedure, simple to apply and with minimal time and effort when using. The numerical experiment indicates that the two new methods are effective and promising.

Research paper thumbnail of A New Revised Efficient of VAM to Find the Initial Solution for the Transportation Problem

Research paper thumbnail of A Modification to Vogel’s Approximation Method to Solve Transportation Problems

Research paper thumbnail of Solving a Large-Scale Nonlinear System of Monotone Equations by using a Projection Technique

In this study, we suggest a new projection algorithm for solving nonlinear systems of monotone eq... more In this study, we suggest a new projection algorithm for solving nonlinear systems of monotone equations. The projection methods are an efficient family of derivative free methods for solving nonlinear systems of monotone equation that is in each iteration, the current iterate is strictly separated from the solution set of the problem by an appropriate hyperplane that constructs by the new projection algorithm. Then the current iterate is projected onto this hyperplane to determine the new approximation. Under standard assumptions, the global convergence of the proposed algorithm are proved. The numerical experiments indicate the efficiency of the proposed algorithm.

Research paper thumbnail of A New Line Search Method to Solve the Nonlinear Systems of Monotone Equations

In this study, we suggest a new line search algorithm for solving nonlinear systems of equations ... more In this study, we suggest a new line search algorithm for solving nonlinear systems of equations such that we combine a monotone technique into a modified line search rule. The new proposed algorithm can decrease the CPU time, the number of iterations and the function evaluations and can increase the efficiency of the approach. Under some standard conditions, the global convergence of the algorithm is proved. Preliminary numerical results shows that the new algorithm is promised for solving nonlinear systems of equations monotone equations.

Optimizing the project quality with lowest added c by Dr. Hussein Ali Hussein Al-Dallal Al-Saeedi

Research paper thumbnail of A New Technique for Finding the Optimal Solution to Assignment Problems with Maximization Objective Function

Journal of Physics: Conference Series, 2021

The assignment problems (AP) are an important part of linear programming problems (LPP) that deal... more The assignment problems (AP) are an important part of linear programming problems (LPP) that deal with the allocation of different resources for different activities based on one to one. The assignment problem is established in a variety positions when decision makers need to determine the optimal allocation and this means assigning only one task to one person to achieve maximum profits or imports or achieve less time or less cost based on the type of problem. In this work, a new technique has been provided to find an optimal solution for the assignment problems of maximization objective function. Comparing the proposed technique results with the Hungarian method indicates that the new technique has easier and less steps to find the optimal solution and thus the time is reduced and the effort is largely reduced.

Research paper thumbnail of A New Line Search Method to Solve the Nonlinear Systems of Monotone Equations

Journal of Engineering and Applied Sciences, 2019

Research paper thumbnail of A new technique to solve the maximization of the transportation problems

INTERNATIONAL CONFERENCE OF COMPUTATIONAL METHODS IN SCIENCES AND ENGINEERING ICCMSE 2021

Research paper thumbnail of Two New Effective Methods to Find the Optimal Solution for the Assignment Problems

Journal of Advanced Research in Dynamical and Control Systems, 2020

Research paper thumbnail of Solving a Large-Scale Nonlinear System of Monotone Equations by using a Projection Technique

Journal of Engineering and Applied Sciences, 2019

In this study, we suggest a new projection algorithm for solving nonlinear systems of monotone eq... more In this study, we suggest a new projection algorithm for solving nonlinear systems of monotone equations. The projection methods are an efficient family of derivative free methods for solving nonlinear systems of monotone equation that is in each iteration, the current iterate is strictly separated from the solution set of the problem by an appropriate hyperplane that constructs by the new projection algorithm. Then the current iterate is projected onto this hyperplane to determine the new approximation. Under standard assumptions, the global convergence of the proposed algorithm are proved. The numerical experiments indicate the efficiency of the proposed algorithm.

Research paper thumbnail of A New Technique to Solve the Maximization of the Transportation Problems

One of the most important linear programming applications in operations research (OR) is the tran... more One of the most important linear programming applications in operations research (OR) is the transportation problems (TP) formulation and solution as a linear programming problem (LPP) which is related to daily activities in our real life and mainly deals with logistics. The objective of this work is to introduce a new technique for solving (TP) that has an objective function of the type of maximization. This new technique was obtained by adding an important step to the method for finding the initial solution (IS) for the (TP) that has an objective function of the type of miniaturization that was proposed previously by Hussein, H. A. et al. This proposed new technique solves both of balanced and unbalanced (TP), it includes easy solution steps in terms of understanding and application, as well as achieving the results of the optimal or near the optimal solution (OS), thus saving a lot of time and effort when using it to solve these problems. By comparing the new technique with the three classical methods, NorthWest corner method (NWCM), least cost method (LCM), and Vogel's Approximation Method (VAM), the (IS) obtained by the new technique is better than the three methods in general. Furthermore the new technique is characterized by the ease, simplicity and speed of implementation the steps compared with the other three methods.

Research paper thumbnail of A New Revised Efficient of VAM to Find the Initial Solution for the Transportation Problem

Journal of Physics: Conference Series, 2020

Transportation Problem (TP) is a very important problem which has been vastly studied in Operatio... more Transportation Problem (TP) is a very important problem which has been vastly studied in Operations Research domain. There are some classical methods to find the initial basic feasible solution (IBFS) which minimize the total shipping cost of (TP) such as north-west corner method (NWCM), minimum cost method (MCM) and Vogel’s approximation method (VAM) which the best one of them. In this paper, we suggest a new amendment to (VAM) to find (IBFS) of (TP), which is an iterative method and the results will be near the optimal solution and in some cases equal to the optimal solution. In the numerical experiences we compare the results of the new approach with other classical methods to verify the efficiency of the new method. The proposed method is very effective and well-suited for use in solving these problems of various sizes.

Research paper thumbnail of A Modification to Vogel’s Approximation Method to Solve Transportation Problems

Journal of Physics: Conference Series, 2020

Transportation Problem (TP) is singular of the paradigms in the Linear Programming Problems (LPP)... more Transportation Problem (TP) is singular of the paradigms in the Linear Programming Problems (LPP). The TP in Operations Research represent vastly applied optimization. (TP) has some goals, like reducing transportation costs or reducing transportation time, etc. Whereas meeting both supply level and request level requirements. Transportation problem plays a major role in industry, trade, logistics, etc. To get the most possible profit, organizations are always looking for better ways to reduce cost and improve revenue. To solve the transportation problems, it is always required to find an initial basic feasible solution (IBFS) for get the optimal solution. The Vogel’s Approximation Method (VAM) is the important known traditional methods for obtaining an IBFS of TP. In this work, we introduce a new modification to the VAM for finding an IBFS for the transportation problems almost nearer to the optimal solve. Proposed modification is illustrated with solved numerical examples. A compar...

Research paper thumbnail of A New Technique for Finding the Optimal Solution to Assignment Problems with Maximization Objective Function

IOP Publishing, 2021

The assignment problems (AP) are an important part of linear programming problems (LPP) that deal... more The assignment problems (AP) are an important part of linear programming problems (LPP) that deal with the allocation of different resources for different activities based on one to one. The assignment problem is established in a variety positions when decision makers need to determine the optimal allocation and this means assigning only one task to one person to achieve maximum profits or imports or achieve less time or less cost based on the type of problem. In this work, a new technique has been provided to find an optimal solution for the assignment problems of maximization objective function. Comparing the proposed technique results with the Hungarian method indicates that the new technique has easier and less steps to find the optimal solution and thus the time is reduced and the effort is largely reduced.

Research paper thumbnail of New Technique for Finding the Maximization to Transportation Problems

IOP Publishing, 2021

Transportation problems (TP) are one of the important problems in linear programming problems (LP... more Transportation problems (TP) are one of the important problems in linear programming problems (LPP) that generally address the problems of transporting and distributing goods with the aim of achieving the largest profit or the lowest cost depending on the type of problem addressed. In this research study, a new technique was proposed to solve transportation problems with an objective function of the type of maximization that is used to achieve the highest possible profit. This technique was obtained by relying on a published research paper that deals with the same problem but with an objective function of the miniaturization type. The efficiency of this new technique was tested in terms of the type of results obtained when it was used to solve many transportation problems in life, and some of them were mentioned in this paper. After that, the solution results were compared using the proposed technique with the use of the three well-known classical methods which are NWCM, LCM, and VAM. Whereas, the results using the new technique were the required results that represent the optimal solution or close to the optimal solution.

Research paper thumbnail of Solving Systems of Nonlinear Monotone Equations by Using a New Projection Approach

IOP Publishing, 2021

The projection technique is one of the famous method and highly useful to solve the optimization ... more The projection technique is one of the famous method and highly useful to solve the optimization problems and nonlinear systems of equations. In this work, a new projection approach for solving systems of nonlinear monotone equation is proposed combining with the conjugate gradient direction because of their low storage. The new algorithm can be used to solve the large-scale nonlinear systems of equations and satisfy the sufficient descent condition. The new algorithm generates appropriate direction then employs a good line search along this direction to reach a new point. If this point solves the problem then the algorithm stops, otherwise, it constructs a suitable hyperplane that strictly separate the current point from the solution set. The next iteration is obtained by projection the new point onto the separating hyperplane. We proved that the line search of the new projection algorithm is well defined. Furthermore, we established the global convergence under some mild conditions. The numerical experiment indicates that the new method is effective and very well.

Research paper thumbnail of A New Modified TR Algorithm with Adaptive Radius to Solve a Nonlinear Systems of Equations

IOP Publishing, 2021

The trust region method (TRM) is a very important technique to solve both of linear and nonlinear... more The trust region method (TRM) is a very important technique to solve both of linear and nonlinear systems of equations. In this work, a new modified algorithm of a TRM with adaptive radius is introduced in purpose of solving systems of nonlinear equations. At each iteration, the new algorithm changes the trust region radius (TRR) automatically to reduce the subproblems resolving number when the current radius is rejected. The global convergence results of the new procedure under some appropriate conditions is established. The numerical effects indicate that the suggested algorithm is interesting and robustness.

Research paper thumbnail of Two New Effective Methods to Find the Optimal Solution for the Assignment Problems

Assignment problem (AP) is one of the main optimization problems, itis a private type of transpor... more Assignment problem (AP) is one of the main optimization problems, itis a private type of transportation problem (TP) in which every origin must have the ability to meet the request of any destination, i.e. any worker must be able to perform any job. The assignment problem is used to find one for one among a group of workers each of whom specializes for a specific job among a set of jobs, the main goal is to reduce gross cost (or reduce gross time) according to user requirements. This paper introduces two new methods (Al-Saeedi's 1st M. and Al-Saeedi's 2nd M.) to find a solution to the assignment problem. Moreover, some numerical examples were given to compare the results of the solution of the two new methods with the result of the solution of the Hungarian method. The two new methods are a systematic procedure, simple to apply and with minimal time and effort when using. The numerical experiment indicates that the two new methods are effective and promising.

Research paper thumbnail of A New Revised Efficient of VAM to Find the Initial Solution for the Transportation Problem

Research paper thumbnail of A Modification to Vogel’s Approximation Method to Solve Transportation Problems

Research paper thumbnail of Solving a Large-Scale Nonlinear System of Monotone Equations by using a Projection Technique

In this study, we suggest a new projection algorithm for solving nonlinear systems of monotone eq... more In this study, we suggest a new projection algorithm for solving nonlinear systems of monotone equations. The projection methods are an efficient family of derivative free methods for solving nonlinear systems of monotone equation that is in each iteration, the current iterate is strictly separated from the solution set of the problem by an appropriate hyperplane that constructs by the new projection algorithm. Then the current iterate is projected onto this hyperplane to determine the new approximation. Under standard assumptions, the global convergence of the proposed algorithm are proved. The numerical experiments indicate the efficiency of the proposed algorithm.

Research paper thumbnail of A New Line Search Method to Solve the Nonlinear Systems of Monotone Equations

In this study, we suggest a new line search algorithm for solving nonlinear systems of equations ... more In this study, we suggest a new line search algorithm for solving nonlinear systems of equations such that we combine a monotone technique into a modified line search rule. The new proposed algorithm can decrease the CPU time, the number of iterations and the function evaluations and can increase the efficiency of the approach. Under some standard conditions, the global convergence of the algorithm is proved. Preliminary numerical results shows that the new algorithm is promised for solving nonlinear systems of equations monotone equations.