An Application of Mangasarian’s Theorem

When: Friday, March 30, 2018
Where: PGH 232
Time: 11:00 AM

Speaker: Dr. Michael Laidacker, Department of Mathematics, Lamar University

Host: Dr. Albert Cheng

O. L. Mangasarian, in his 1976 paper "Linear complementarity problems solvable by a single linear program," describes a method for solving linear complementarity problems by converting then to linear programming problems. However, the method relies on knowing a list of 0-1 constants which depend on the individual linear complementarity problems before the conversion can be carried out. The talk shows how the conversion can be carried out in practice for a specific type of linear complementarity problem.

The results have strong implications towards resolving the  P=NP question and the mathematics needed to understand the talk is minimal.

Bio:

Michael Laidacker obtained his PhD from the University of Houston in continuum theory in topology.  Presently, he is an Associate Professor in the Department of Mathematics at Lamar University.  His present interests include problems involving intractability, special relativity, and differential equations. Last year, he was given a leave of absence to complete the writing of a book on bounded linear Diophantine equations.