A stochastic geometric programming problem with multiplicative recourse

DOI10.1016/0167-6377(90)90048-AzbMath0703.90069MaRDI QIDQ916566

Elsie Sterbin Gottlieb

Publication date: 1990

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(90)90048-a

zbMATH Keywords

multiplicative recourse model; stochastic geometric programming

Mathematics Subject Classification ID

90C30: Nonlinear programming

90C15: Stochastic programming

90-08: Computational methods for problems pertaining to operations research and mathematical programming

Related Items

Range division and contraction algorithm for a class of global optimization problems, Global optimization for the generalized polynomial sum of ratios problem, A robust algorithm for generalized geometric programming, An infeasible interior-point algorithm for solving primal and dual geometric programs, A global optimization approach for solving generalized nonlinear multiplicative programming problem, Global optimization of generalized geometric programming, Copula theory approach to stochastic geometric programming, Branch-reduction-bound algorithm for generalized geometric programming, Perfect duality in solving geometric programming problems under uncertainty, A nonisolated optimal solution for special reverse convex programming problems, A deterministic global optimization algorithm for generalized geometric programming, Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Use of Sample Information in Stochastic Recourse and Chance-Constrained Programming Models
• Optimal design modifications by geometric programming and constrained stochastic network models
• Optimal Engineering Design Under Uncertainty by Geometric Programming
• Programming Under Uncertainty: The Equivalent Convex Program