ENUMERATION OF ALL SOLUTIONS OF A COMBINATORIAL LINEAR INEQUALITY SYSTEM ARISING FROM THE POLYHEDRAL HOMOTOPY CONTINUATION METHOD

DOI10.15807/jorsj.45.64zbMath1031.65074OpenAlexW2132648405MaRDI QIDQ4483735

Akiko Takeda, Kojima, Masakazu, Katsuki Fujisawa

Publication date: 25 August 2003

Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.15807/jorsj.45.64

zbMATH Keywords

numerical examplesduality theorysimplex methodpolyhedral homotopy continuation methodcombinatorial linear inequality system

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Linear programming (90C05) Combinatorial optimization (90C27) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20)

Related Items (3)

Computing all nonsingular solutions of cyclic-\(n\) polynomial using polyhedral homotopy continuation methods ⋮ The norm of the Fourier transform on finite abelian groups ⋮ Mixed cell computation in HOM4ps

Uses Software

• PHCpack
• Ninf-G/MPI

This page was built for publication: ENUMERATION OF ALL SOLUTIONS OF A COMBINATORIAL LINEAR INEQUALITY SYSTEM ARISING FROM THE POLYHEDRAL HOMOTOPY CONTINUATION METHOD