Project selection with discounted returns and multiple constraints

DOI10.1016/0377-2217(95)00156-5zbMath0929.90037OpenAlexW2029809457MaRDI QIDQ1278274

Sushil K. Gupta, Chi-Ming Ip, Kyparisis, George J.

Publication date: 22 February 1999

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

Full work available at URL: https://doi.org/10.1016/0377-2217(95)00156-5

zbMATH Keywords

algorithmsheuristicsinteger programmingdynamic programmingproject selectionapplicationssingle machinesequencingnonlinear problem

Mathematics Subject Classification ID

Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Related Items (6)

Optimal selection of energy efficiency measures for energy sustainability of existing buildings ⋮ Balancing and optimizing a portfolio of R&D projects ⋮ Selection among ranked projects under segmentation, policy and logical constraints ⋮ A new multi-objective algorithm for a project selection problem ⋮ Project prioritization under policy restrictions. A combination of MCDA with 0-1 programming ⋮ Decision support system for multicriterial R\& D and information systems projects selection

Cites Work

• Unnamed Item
• Unnamed Item
• Heuristics and their design: A survey
• Heuristic methods and applications: A categorized survey
• Resource Allocation to Interrelated Risky Projects Using a Multiattribute Utility Function
• Note—Project Selection and Sequencing to Maximize Net Present Value of the Total Return

This page was built for publication: Project selection with discounted returns and multiple constraints