Dependent-chance integer programming applied to capital budgeting

DOI10.1016/S0453-4514(99)80009-XMaRDI QIDQ4538136zbMATHOpenAlexFDO

Authors Kakuzo Iwamura, Baoding Liu

Publication date 11 July 2002

Full work available at URL https://doi.org/10.1016/s0453-4514(99)80009-x

Mathematics Subject Classification ID

Integer programming (90C10)

Recommendations

• Chance constrained integer programming models for capital budgeting in fuzzy environments
• Credibility-based chance-constrained integer programming models for capital budgeting with fuzzy parameters
• Chance-constrained goal programming model for capital budgeting problems in fuzzy environment
• Modelling stochastic decision systems using dependent-chance programming
• Capital Budgeting Under Uncertainty—An Integrated Approach Using Contingent Claims Analysis and Integer Programming

Cited in

(16)

• Generating the Discrete Efficient Frontier to the Capital Budgeting Problem
• λ credibility
• An approximate solution approach for a scenario-based capital budgeting model
• Capital budgeting with borrowing money in stochastic environment
• scientific article; zbMATH DE number 1530371 (Why is no real title available?)
• Uncertain programming: A unifying optimization theory in various uncertain environments
• scientific article; zbMATH DE number 428256 (Why is no real title available?)
• Chance constrained integer programming models for capital budgeting in fuzzy environments
• Capital rationing problems under uncertainty and risk
• A multistage stochastic programming approach for capital budgeting problems under uncertainty
• Multi-objective meta-heuristics: An overview of the current state-of-the-art
• The variable sequencing approach: A solution to the capital budget allocation model
• Capital Budgeting Under Uncertainty—An Integrated Approach Using Contingent Claims Analysis and Integer Programming
• Abandonment value in capital budeting: A mathematical programming approach
• From finitely many independent fuzzy sets to possibility-based fuzzy linear programming problems
• Approximate and exact merging of knapsack constraints with cover inequalities

This page was built for publication: Dependent-chance integer programming applied to capital budgeting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4538136)