An algorithm for solving a structured class of linear programming problems

DOI10.1016/0167-6377(86)90032-5zbMath0595.90055OpenAlexW2090512332MaRDI QIDQ1078069

S. Selcuk Erenguc

Publication date: 1986

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(86)90032-5

zbMATH Keywords

intervallinear programmingproduction planningknapsackportfolio selectionadvertisingsequence of continuous knapsack problemsspecially structured linear programsweighted selection algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Linear programming (90C05)

Related Items (2)

A branch and bound algorithm for a single item nonconvex dynamic lot sizing problem with capacity constraints ⋮ An O(n log n)-algorithm for solving a special class of linear programs

Cites Work

• An algorithm for indefinite integer quadratic programming
• A Weighted Selection Algorithm for Certain Tree-Structured Linear Programs
• A Decomposition Method for Interval Linear Programming
• Flows in Arborescences

This page was built for publication: An algorithm for solving a structured class of linear programming problems