Method for solving minimax and linear programming problems

(19)

(11)

EP 2 071 473 A8

(12)	CORRECTED EUROPEAN PATENT APPLICATION
	Note: Bibliography reflects the latest situation

(15)	Correction information:
	Corrected version no 1 (W1 A2)

(48)	Corrigendum issued on:
	14.10.2009 Bulletin 2009/42

(43)	Date of publication:
	17.06.2009 Bulletin 2009/25

(21)	Application number: 08019504.3

(22)	Date of filing: 07.11.2008

(51)

International Patent Classification (IPC):

G06F 17/11^(2006.01)

(84)	Designated Contracting States:
	AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MT NL NO PL PT RO SE SI SK TR
	Designated Extension States:
	AL BA MK RS

(30)

Priority:

07.11.2007 US 986157 P
24.01.2008 US 19532

(71)	Applicant: Triantafillidis, Trifon
	55236 Panorama (GR)

(72)	Inventor:
	Triantafillidis, Trifon 55236 Panorama (GR)

(74)	Representative: Gesthuysen, von Rohr & Eggert
	Patentanwälte Huyssenallee 100 45128 Essen 45128 Essen (DE)

(54)	Method for solving minimax and linear programming problems

(57) A novel method is disclosed for efficiently solving minimax problems, and in particular, for efficiently solving minimax problems wherein the corresponding matrix is large. In particular, the novel method solves minimax problems in O(n² T) operation count, where denotes the problem size and T is reversely proportional to the required duality gap as one skilled in the art will understand, Further disclosed herein is a method for solving linear programming (LP) problems by converting such problems into minimax problems, and then using the novel minimax solution method disclosed herein.