The stochastic linear continuous type knapsack problem: A generalized P model

DOI10.1016/0377-2217(85)90316-9zbMath0551.90072OpenAlexW2003743104MaRDI QIDQ800831

Toshio Nishida, Hiroaki Ishii

Publication date: 1985

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(85)90316-9

zbMATH Keywords

polynomial time algorithmcombinatorial analysisoptimal solutiondeterministic equivalent problemstochastic linear continuous type knapsak problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Stochastic programming (90C15) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items

Stochastic linear knapsack programming problem and its application to a portfolio selection problem ⋮ A Solution Strategy for a Class of Nonlinear Knapsack Problems

Cites Work

• An Algorithm for Large Zero-One Knapsack Problems
• A polynomially bounded algorithm for a singly constrained quadratic program
• Selecting the Kth Element in $X + Y$ and $X_1 + X_2 + \cdots + X_m $
• A GENERALIZED CHANCE CONSTRAINT PROGRAMMING PROBLEM