19 pages matching replacement in this book
Results 1-3 of 19
What people are saying - Write a review
We haven't found any reviews in the usual places.
PrimalDual Constraint Aggregation with Application to Stochastic Programming
21 other sections not shown
A/-scenarios active set aggregation algorithm analysis applied approach approximate asset bond capacity coefficients components computational considered constraints convergence convex corresponding CPLEX cutting plane data set decision variables defined denote distribution dynamic equation error evaluation feasible first-stage fixed costs flexibility formulation geometric Brownian motion heuristic hyperplane implementation index set initial integer linear programming interior point interior point methods investment Italian Liras knapsack problem Lagrangian lattice learning lemma linear programming lower bound machine Mathematical Programming maximize maximum MILP multistage stochastic Newton step node objective function obtained Operations Research optimal solution optimal value optimization problem option paper parallel parameters polytope portfolio selection primal-dual procedure production programming problems Proof quadratic random replacement reservoir volume risk scenario tree simulation solve stochastic optimization stochastic programming strategy subproblems theorem tion transaction costs tuple uncertainty University update upper bound vector yield yield curve