We consider solution strategies for stochastic programs whose deterministic equivalent programs take on one specific form. We suggest algorithms based upon (i) extensions of the revised simplex method, (ii) inner approximations (generalized programming techniques), (iii) outer approximations (min-max strategies). We briefly discuss implementation and associated software considerations.