Disjunctive Decomposition for Two-Stage Stochastic Mixed-Binary Programs With Random Recourse

Operations Research - United States
doi 10.1287/opre.1090.0693
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Institute for Operations Research and the Management Sciences (INFORMS)

Related search

Decomposition Based Interior Point Methods for Two-Stage Stochastic Convex Quadratic Programs With Recourse

Operations Research
Management ScienceComputer Science ApplicationsOperations Research
2009English

Decomposition Algorithms for Two-Stage Distributionally Robust Mixed Binary Programs

SIAM Journal on Optimization
Theoretical Computer ScienceSoftware
2018English

Lipschitz Stability for Stochastic Programs With Complete Recourse

SIAM Journal on Optimization
Theoretical Computer ScienceSoftware
1996English

Smoothing Techniques and Augmented Lagrangian Method for Recourse Problem of Two-Stage Stochastic Linear Programming

Journal of Applied Mathematics
Applied Mathematics
2013English

Disjunctive Programs With Set Constraints

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

A Two-Stage Parallel Branch and Bound Algorithm for Mixed Integer Programs

IMA Journal of Management Mathematics
ManagementFinanceApplied MathematicsEconomicsSimulationManagement ScienceManagement Information SystemsModelingStrategyEconometricsOperations Research
2004English

Solution Methods and Bounds for Two-Stage Risk-Neutral and Multistage Risk-Averse Stochastic Mixed-Integer Programs With Applications in Energy and Manufacturing

English

An Alternating Method for Stochastic Linear Programming With Simple Recourse

Stochastic Programming 84 Part I
1986English

A Scenario Tree-Based Decomposition for Solving Multistage Stochastic Programs

2011English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy