Linear Programming complementation

In this paper we introduce a new operation for Linear Programming (LP), called LP complementation, which resembles many properties of LP duality. Given a maximisation (resp. minimisation) LP P, we define its complement Q as a specific minimisation (resp. maximisation) LP which has the same objective...

Full description

Bibliographic Details

Published in:	Theoretical computer science Vol. 1032; p. 115087
Main Authors:	Gadouleau, Maximilien, Mertzios, George B., Zamaraev, Viktor
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 29.03.2025
Subjects:	Duality Fractional dominating number Fractional vertex cover Hypergraph Linear Programming Hypergraph Duality Fractional vertex cover Fractional dominating number Linear Programming
ISSN:	0304-3975
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!