Covert Factor’s Exploiting and Factor Planning

Hui Sun (), Fanhui Zeng () and Yang Yang
Additional contact information
Hui Sun: Liaoning Technical University
Fanhui Zeng: Liaoning Technical University
Yang Yang: Liaoning Technical University

Annals of Data Science, 2022, vol. 9, issue 3, No 3, 449-467

Abstract: Abstract All the classification solutions in artificial intelligence can be summed up as explicit factor implicit problem, and the explicit factor implicit problem should be solved by linear programming. The simplex linear programming algorithm is simple and fast, but it is not a polynomial algorithm. Whether it can be improved into a “strong polynomial algorithm”, that is, in any case, the number of operations of this algorithm is a polynomial function of the number of equations and variables, is a trans-century international mathematical problem that has been unsolved for decades. This question, which involves the mathematical boundaries of ai development, is crucial. The method of solving programming problem from the demand and specialty of artificial intelligence is called factor programming. This paper will introduce the basic ideas of factor explicit and implicit programming and factor programming, and write programs for some of the algorithms, and prove the theorem of triangular matrix optimization.

Keywords: Factor space; Linear programming; Simplex; Covert factor’s exploiting (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s40745-022-00394-9 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:aodasc:v:9:y:2022:i:3:d:10.1007_s40745-022-00394-9

Ordering information: This journal article can be ordered from
https://www.springer ... gement/journal/40745

DOI: 10.1007/s40745-022-00394-9

Access Statistics for this article

Annals of Data Science is currently edited by Yong Shi

More articles in Annals of Data Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().