Trees and hills: methodology for maximizing functions of systems of linear relations

zbMath0642.90066MaRDI QIDQ1101340

Rick Greer

Publication date: 1984

Published in: Annals of Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

tree algorithmpolyhedral convex conesfunctions of systems of linear relations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Linear programming (90C05) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Polytopes and polyhedra (52Bxx)

Related Items (9)

On minimal positive basis for polyhedral cones in Rn ⋮ Maximum feasible subsystems of distance geometry constraints ⋮ A Benson-type algorithm for bounded convex vector optimization problems with vertex selection ⋮ The MIN PFS problem and piecewise linear model estimation ⋮ The complexity and approximability of finding maximum feasible subsystems of linear relations ⋮ On highly robust efficient solutions to uncertain multiobjective linear programs ⋮ On linear operators preserving certain cones in \(\mathbb{R}^n\) ⋮ On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems ⋮ Nonlinear desirability as a linear classification problem

This page was built for publication: Trees and hills: methodology for maximizing functions of systems of linear relations