A Boolean programming problem of choosing an optimal portfolio of projects and optimal schedules for them by reinvesting within the portfolio the profit from project implementation

DOI10.1016/j.aml.2011.11.026zbMath1247.90195OpenAlexW2037919071MaRDI QIDQ452908

A. S. Belen'kij

Publication date: 18 September 2012

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aml.2011.11.026

zbMATH Keywords

Boolean programmingoptimal portfolioBoolean variablesprecedence conditions

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Deterministic scheduling theory in operations research (90B35) Boolean programming (90C09)

Related Items

Optimal selection of project portfolios using reinvestment strategy within a flexible time horizon, Uncertain mean-variance model for dynamic project portfolio selection problem with divisibility

Cites Work

• Analyzing the potential of a firm: an operations research approach.
• Hybrid algorithm for scheduling with regard for reinvestment of profits
• Unnamed Item