Linear programming measures for solving the problem of a linear division of convex multiplayers.

Authors

  • Sarmad H. Ali Electronic Computer Center , Al-Muthanna University
  • Osamah A. Ali Electronic Computer Center , Al-Muthanna University
  • Samir C. Ajmi Electronic Computer Center , Al-Muthanna University

DOI:

https://doi.org/10.29304/jqcm.2018.10.2.395

Keywords:

simplex method, linear programming problem, Quadratic simplex method, separating hyperplane

Abstract

In this research, we are trying to solve Simplex methods which are used for successively improving solution and finding the optimal solution, by using different types of methods Linear, the concept of linear separation is widely used in the study of machine learning, through this study we will find the optimal method to solve by comparing the time consumed by both Quadric and Fisher methods.

Downloads

Download data is not yet available.

Downloads

Published

2018-06-10

How to Cite

H. Ali, S., A. Ali, O., & C. Ajmi, S. (2018). Linear programming measures for solving the problem of a linear division of convex multiplayers. Journal of Al-Qadisiyah for Computer Science and Mathematics, 10(2), Math Page 79 – 91. https://doi.org/10.29304/jqcm.2018.10.2.395

Issue

Vol. 10 No. 2 (2018): JQCM

Section

Math Articles