An \(O(n^ 3\log n)\) strong polynomial algorithm for an isotonic regression knapsack problem

DOI10.1007/BF00940553zbMath0797.90073MaRDI QIDQ1321426

V. Pereyra

Publication date: 27 April 1994

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

Lagrange multiplieroptimality conditionsKarush-Kuhn-Tucker conditionsLagrange functionactive setsbreakpointsisotonic regression knapsackmaximal cutsstrong polynomial time

Mathematics Subject Classification ID

Quadratic programming (90C20) Sensitivity, stability, parametric optimization (90C31)

Cites Work

• Active set algorithms for isotonic regression; a unifying framework
• Establishing Consistent and Realistic Reorder Intervals in Production-Distribution Systems

This page was built for publication: An \(O(n^ 3\log n)\) strong polynomial algorithm for an isotonic regression knapsack problem