𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A stochastic geometric programming problem with multiplicative recourse

✍ Scribed by R. Jagannathan

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
327 KB
Volume
9
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

SPAR: stochastic programming with advers
SPAR: stochastic programming with adversarial recourse
✍ Matthew D. Bailey; Steven M. Shechter; Andrew J. Schaefer πŸ“‚ Article πŸ“… 2006 πŸ› Elsevier Science 🌐 English βš– 189 KB

We consider a general adversarial stochastic optimization model. Our model involves the design of a system that an adversary may subsequently attempt to destroy or degrade. We introduce SPAR, which utilizes mixed-integer programming for the design decision and a Markov decision process (MDP) for the

Solving stochastic programs with network
Solving stochastic programs with network recourse
✍ Stein W. Wallace πŸ“‚ Article πŸ“… 1986 πŸ› John Wiley and Sons 🌐 English βš– 997 KB

In this paper we provide computational procedures for solving stochastic programs with network recourse. Special attention is paid to the feasibility problem, and we show how to solve the recourse or second stage problem. This problem is how to solve a large number of networks where the only differe

Geometric programming with multiplicativ
Geometric programming with multiplicative slack variables
✍ John R. McNamara πŸ“‚ Article πŸ“… 1986 πŸ› John Wiley and Sons 🌐 English βš– 670 KB

A posynomial geometric programming problem formulated so that the number of objective function terms is equal to the number of primal variables will have a zero degree of difficulty when augmented by multiplying each constraint term by a slack variable and including a surrogate constraint composed o