Technical Note—The Use of Cuts in Complementary Programming

Toshihide Ibaraki
Additional contact information
Toshihide Ibaraki: Kyoto University, Kyoto, Japan

Operations Research, 1973, vol. 21, issue 1, 353-359

Abstract: A complementary programming problem is a linear programming problem with the additional restriction that x p x q = 0 holds for each specified pair ( x p , x q ). This paper obtains constraints called C-cuts from the restriction x p x q = 0, and uses them to facilitate the computation of the branch-and-bound procedure proposed in an earlier paper [ Opns. Res. 19, 1523–1528 (1971)]. Some computational results are also reported.

Date: 1973
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.21.1.353 (application/pdf)

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:inm:oropre:v:21:y:1973:i:1:p:353-359

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().