Primal-dual methods for sustainable harvest scheduling problems

DOI10.1016/S0305-0548(00)00005-8zbMath1020.90024OpenAlexW2111465010MaRDI QIDQ5953164

Chiun-Ming Liu

Publication date: 2001

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(00)00005-8

zbMATH Keywords

mathematical programmingprimal-dual algorithmtimber harvest scheduling

Mathematics Subject Classification ID

Numerical methods involving duality (49M29) Management decision making, including multiple objectives (90B50) Deterministic scheduling theory in operations research (90B35)

Uses Software

• AMPL
• CPLEX
• DEVEX

Cites Work

• An optimization problem in forest management
• Steepest-edge simplex algorithms for linear programming
• A practicable steepest-edge simplex algorithm
• Pivot selection methods of the Devex LP code
• Forest Management: A Multicommodity Flow Formulation and Sensitivity Analysis

This page was built for publication: Primal-dual methods for sustainable harvest scheduling problems