Developing a Boundary Point Method Algorithm for Solving Linear Programming Problems with Feasible Initial Solution

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Nekufar Mohammad; Movafaghpour Mohammad Ali

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: Modeling in Engineering Year:2019 | Volume:17 | Issue:56 Page(s): 85-99

Download Full-Text

Persian Verion

View:

452

Download:

Cites:

Information Journal Paper

Title

Developing a Boundary Point Method Algorithm for Solving Linear Programming Problems with Feasible Initial Solution

Author(s)

Nekufar Mohammad | Movafaghpour Mohammad Ali | Issue Writer Certificate

Keywords

Linear ProgrammingQ2

Active Set MethodsQ1

Polynomial Time OrderQ1

Feasible Direction MethodQ1

Abstract

In this research, SALCHOW algorithm has been developed to solve Linear Programming problems. In each step SLACHOW moves towards the constrained gradient of the objective function, so that it always remains within the feasible region. This type of generating sequence of feasible solutions on the boundary of the feasible region differs from the behavior of the simplex. Simplex moves on the corners of the feasible region. On the other hand, SALCHOW is also different from interior point methods; because interior point methods generate solutions that are not on the corner points or even borders of feasible region. SALCHOW assigns a set of coefficients to some active constraints for appending to objective function and updating constrained gradient of objective function. Finally at the optimal point, the Lagrange coefficients of the active constraints are found. Computational results are generated by using a set of randomly generated instance problems and a few standard ones from OR-Library. These results show the superiority of SALCHOW over the simplex in these small instances. In other words, the mean time of solving an instance with SALCHOW is a function of the number of decision variables in contrast with Simplex. Runtime of simplex in the average is a function of the number of constraints. The computational errors caused by round off errors in developed code in MATLAB exhibits that our developed code for SALCHOW suffers from cumulative errors; and it obstructs the possibility of judging the definite superiority of SALCHOW over the simplex in solving small instance problems.

Cites

No record.

References

No record.

Cite

APA: Copy

Nekufar, Mohammad, & Movafaghpour, Mohammad Ali. (2019). Developing a Boundary Point Method Algorithm for Solving Linear Programming Problems with Feasible Initial Solution. JOURNAL OF MODELING IN ENGINEERING, 17(56 ), 85-99. SID. https://sid.ir/paper/395699/en

Vancouver: Copy

Nekufar Mohammad, Movafaghpour Mohammad Ali. Developing a Boundary Point Method Algorithm for Solving Linear Programming Problems with Feasible Initial Solution. JOURNAL OF MODELING IN ENGINEERING[Internet]. 2019;17(56 ):85-99. Available from: https://sid.ir/paper/395699/en

IEEE: Copy

Mohammad Nekufar, and Mohammad Ali Movafaghpour, “Developing a Boundary Point Method Algorithm for Solving Linear Programming Problems with Feasible Initial Solution,” JOURNAL OF MODELING IN ENGINEERING, vol. 17, no. 56 , pp. 85–99, 2019, [Online]. Available: https://sid.ir/paper/395699/en

Related Journal Papers