stochastic gp with multiplicative recourse

6
Operations Research Letters 9 (1990) 99-104 March 1990 North-Holland A STOCHASTIC GEOMETRIC PROGRAMMING PROBLEM WITH MULTIPLICATIVE RECOURSE R . JAGANNATHAN Department of Management Sciences and Business Administration, The University of Iowa, Iowa City, IA 52242, USA Received October 1988 Revised August 1989 The polynomials that characterize a geometric programming problem are defined by the coefficients c,j and a,j k, which are usually assumed to be constants. In this paper, we allow these parameters to be random variables with known joint distribution functions and derive the properties of a deterministic equivalent problem corresponding to a multiplicative recourse stochastic model, where the recourse variables rectify in a proportional sense the amount of possible violations of the constraints. geometric programm ing * stochastic program ming * engineering design 1. Introduction Geometric program ming [8] is one of the most versatile tools in the area of engineering design and many examples of successful application of the technique are discussed in [1,5,6,12]. The polynomials that characterize a geometric program are defined by positive coefficients cij and real exponents aijj,. Usually these parameters are assumed to be known constants. Avriel and Wilde [2] formulate a two-stage stochastic geometric program (SGP) with discrete random cij elements and study the properties of the corresponding deterministic equivalent model. In Section 2 of this paper we assume the parameters {q j} and (a,j~} to be random variables with known distribution functions and formulate the SGP model as a multiplicative recourse problem, wherein possible violations in the constraints are corrected in a proportional sense by the recourse variables after the random parameters are observed. We further show that the deterministic equivalent is in general a convex program. In Section 3, a special case of the model is discussed. Stochastic programming deals with situations where the parameters of a decision model under consideration cannot be determined exactly. The unknown parameters are usually assumed to be random variables with a joint probability distribution function. In considering engineering design problems where uncertainties arise in market forecasts or operating conditions a typical approach is to replace the unknown parameters by their expected values. An alternative approach is to consider the decision model under a worst-case situation. Avriel and Wilde [2] point out that the above approaches lead to increased manufacturing cost, which may mean rejection of a new project proposal because of low profit margin. They propose instead a two-stage decision model. In two-stage linear programming under uncertainty, the decision maker chooses the first-stage decision x, then observes the random parameter values, and finally takes recourse action y such that a suitably defined LP problem is solved. The second stage recourse action y is taken when there are no uncertainties left in the model. The objective is then to minimize the total cost that includes the expected minimal second stage cost (see Wets [11] and Dantzig [7], and also Jagannathan [10] for two-stage recourse models when sample information is available). 0167-6377/90/$3.50 © 1990, Elsevier Science Publishers B.V. (North-Holland) 99

Upload: cdmorga1

Post on 07-Apr-2018

239 views

Category:

Documents


0 download

TRANSCRIPT

8/6/2019 Stochastic GP With Multiplicative Recourse

http://slidepdf.com/reader/full/stochastic-gp-with-multiplicative-recourse 1/6

O p e r a t i o n s R e s e a r c h L e t t e rs 9 ( 1 99 0 ) 9 9 - 1 0 4 M a r c h 1 9 9 0

N o r t h - H o l l a n d

A S T O C H A S T I C G E O M E T R I C P R O G R A M M I N G P R O B L E M

W I T H M U L T I P L I C A T I V E R E C O U R S E

R . J A G A N N A T H A N

Department of Management Sciences and Business Adminis tration, The University of Iowa, Iow a City , IA 52242, US A

R e c e i v e d O c t o b e r 1 9 88

R e v i s e d A u g u s t 1 9 89

T h e p o l y n o m i a l s t h a t c h a ra c t e r iz e a g e o m e t r i c p r o g r a m m i n g p r o b l e m a r e d e f i n e d b y t h e c o e f fi c ie n t s c , j a n d a , j k , w h i c h a r e

u s u a l l y a s s u m e d t o b e c o n s t a n t s . In t h i s p a p e r, w e a l l o w t h e s e p a r a m e t e r s t o b e r a n d o m v a r i a b le s w i t h k n o w n j o i n td i s t r i b u t i o n f u n c t i o n s a n d d e r i v e t h e p r o p e r t i e s o f a d e t e r m i n i s t i c e q u i v a l e n t p r o b l e m c o r r e s p o n d i n g t o a m u l t i p l ic a t i v e

r e c o u r s e s t o c h a s t i c m o d e l , w h e r e t h e r e c o u r s e v a r i a b l e s r e c t i fy i n a p r o p o r t i o n a l s e n s e t h e a m o u n t o f p o s s i b l e v io l a t i o n s o f th e

c o n s t r a i n t s .

g e o m e t r i c p r o g r a m m i n g * s t o c h a s ti c p r o g r a m m i n g * e n g i n e e r i n g d e s i g n

1 . I n tr o d u c t i o n

G e o m e t r i c p r o g r a m m i n g [8 ] i s o n e o f t h e m o s t v e r s a t i l e t o o ls i n t h e a r e a o f e n g i n e e r i n g d e s i g n a n d

m a n y e x a m p l e s o f s u c c e s s f u l a p p l i c a t i o n o f t h e t e c h n i q u e a r e d i s c u s s e d i n [ 1 , 5 , 6 , 1 2 ] .

T h e p o l y n o m i a l s t h a t c h a r a c t er i z e a g e o m e t r i c p r o g r a m a r e d e f i n e d b y p o s i t iv e c o e f fi c i e n ts c i j a n d r e a l

e x p o n e n t s a i j j , . U s u a l l y t h e s e p a r a m e t e r s a r e a s s u m e d t o b e k n o w n c o n s t a n t s . A v r i e l a n d W i l d e [ 2 ]

f o r m u l a t e a t w o - s ta g e s t o c ha s t ic g e o m e t r i c p r o g r a m ( S G P ) w i t h d i s cr e t e r a n d o m c ij e l e m e n t s a n d s t u d y

t h e p r o p e r t i e s o f t h e c o r r e s p o n d i n g d e t e r m i n i s t i c e q u i v a l e n t m o d e l .

I n S e c t i o n 2 o f t hi s p a p e r w e a s s u m e t h e p a r a m e t e r s { q j } a n d ( a , j ~ } t o b e r a n d o m v a r ia b l e s w i t h

k n o w n d i s t r i b u t io n f u n c t io n s a n d f o r m u l a t e t h e S G P m o d e l a s a m u l t i p l i c a ti v e r e co u r s e p r o b le m , w h e r e i n

p o s s i b l e v i o la t i o n s in t h e c o n s t r a i n t s a r e c o r r e c t e d i n a p r o p o r t i o n a l s e n s e b y t h e r e c o u r s e v a r i a b l e s a f t e r

t h e r a n d o m p a r a m e t e r s a r e o b s e r v e d . W e f u r t h e r s h o w t h a t t h e d e t e r m i n i s t i c e q u i v a l e n t i s i n g e n e r a l a

c o n v e x p r o g r a m . I n S e c t i o n 3 , a s p ec i a l c a s e o f th e m o d e l i s d i s c u s s e d .

S t o c ha s t ic p r o g r a m m i n g d e a l s w i t h s i t ua t i o n s w h e r e t h e p a r a m e t e r s o f a d e c i si o n m o d e l u n d e r

c o n s i d e r a t io n c a n n o t b e d e t e r m i n e d e x a c t l y . T h e u n k n o w n p a r a m e t e r s a r e u s u al l y a s s um e d t o b e r a n d o m

v a r i a b l e s w i t h a j o i n t p r o b a b i l i t y d i s t r i b u t i o n f u n c t i o n .I n c o n s i d e r i n g e n g i n e e r i n g d e s i g n p r o b l e m s w h e r e u n c e r t a i n t i e s a r i s e i n m a r k e t f o r e c a s t s o r o p e r a t i n g

c o n d i t i o n s a t y p i c al a p p r o a c h i s to r e p l a c e t h e u n k n o w n p a r a m e t e r s b y t h e i r e x p e c t e d v al u es . A n

a l t e r n a t i v e a p p r o a c h i s t o c o n s i d e r t h e d e c i s i o n m o d e l u n d e r a w o r s t - c a s e s i t u a t i o n . A v r i e l a n d W i l d e [ 2 ]

p o i n t o u t t h a t t h e a b o v e a p p r o a c h e s l e a d t o i n cr e a s e d m a n u f a c t u r i n g c o s t, w h i c h m a y m e a n r e j e c t i o n o f a

n e w p r o j e c t p r o p o s a l b e c a u s e o f l o w p r o f i t m a r g i n . T h e y p r o p o s e i n s t e a d a t w o - s t ag e d e c i s io n m o d e l .

I n t w o - s t a g e l i n e a r p r o g r a m m i n g u n d e r u n c e r t a i n t y , t h e d e c i s i o n m a k e r c h o o s e s t h e f i rs t - s ta g e d e c i s i o n

x , t h e n o b s e r v e s t h e r a n d o m p a r a m e t e r v a l u e s , a n d f i n a l l y t a k e s r e c o u r s e a c t i o n y s u c h t h a t a s u it a b l y

d e f i n e d L P p r o b l e m i s s o l v e d. T h e s e c o n d s t a g e r e c o u r s e a c t i o n y i s t a k e n w h e n t h e r e a r e n o u n c e r t a i n t i e s

l e f t i n t h e m o d e l . T h e o b j e c t i v e i s t h e n t o m i n i m i z e t h e t o t a l c o s t t h a t i n c l u d e s t h e e x p e c t e d m i n i m a l

s e c o n d s t a g e c o s t ( s ee W e t s [ 11 ] a n d D a n t z i g [7 ], a n d a l s o J a g a n n a t h a n [1 0] f o r t w o - s t a g e r e c o u r s e m o d e l s

w h e n s a m p l e i n f o r m a t i o n i s a v a i l a b l e ) .

0 1 6 7 - 6 3 7 7 / 9 0 / $ 3 . 5 0 © 1 9 9 0 , E l s e v i e r S c i e n c e P u b l i s h e r s B . V . ( N o r t h - H o l l a n d ) 9 9

8/6/2019 Stochastic GP With Multiplicative Recourse

http://slidepdf.com/reader/full/stochastic-gp-with-multiplicative-recourse 2/6

Volume 9, Numbe r 2 OPERATIO NS RESEARCH LETTERS March 1990

I n a s i m i l ar v e in , A v r i el a n d W i l d e [ 2] su g g e s t a t w o - s t a g e g e o m e t r i c a p p r o a c h t o d e s i g n p r o b l e m s w i t h

d i s c r e t e c u p a r a m e t e r s . T h e v a r i a b l e s a r e c l a s s i f i e d a s

( i ) d e s i g n v a r i a b l e s t h a t a r e u s e d a s f i r s t s t a g e d e c i s i o n v a r i a b l e s , a n d a s

( i i ) o p e r a t i n g v a r i a b l e s ( s e c o n d s t a g e r e c o u r s e v a r i a b l e s ) t h a t a r e a d j u s t e d a c c o r d i n g t o t h e r e a l i z a t i o n o f

t h e r a n d o m p a r a m e t e r s s o t h a t t h e s y s t e m p e r f o r m s a c c o r d i n g t o t h e o r i g i n a l sp e c i fi c a ti o n s .

E c k e r a n d W i e b k i n g [9 ] c o n s i d e r s t h e d e s i g n i n g o f a c o n v e n t i o n a l ' o n c e - t h r o u g h ' c o n d e n s i n g s y s t e m f o ra s t e a m p o w e r p l a n t w h e r e th e t u r b i n e e x h a u s t s t e a m i s c o n d e n s e d i n a s u r f a c e - t y p e c o n d e n s e r a n d t h e

h e a t o f c o n d e n s a t i o n i s c ar r ie d a w a y b y c i r c u l a t i n g w a t e r. I n t h e d e t e r m i n i s t i c c as e , th e p r o b l e m i s

f o r m u l a t e d a s a g e o m e t r i c p r o g r a m w h e r e i n t h e o b j e c t iv e i s t o d e t e r m i n e t h e e x h a u s t p r e s s u re a n d t h e s iz es

o f t h e t u r b i n e e x h a u s t a n n u l u s a n d t h e c o n d e n s e r s u c h t h a t t h e a n n u a l t o t a l c o s t i s m i n i m i z e d . W i e b k i n g

[1 2] c o n s id e r s a t w o - s t a g e s t o c h a s ti c g e o m e t r i c a p p r o a c h t o t h e a b o v e p r o b l e m w h e n t h e e l ec t ri c al o u t p u t ,

o p e r a t i n g t i m e , th e r a t e o f d e p r e c i a t io n , u n i t f u e l c o s t a n d a f e w o t h e r c o s t d e m e n t s a r e a s s u m e d t o b e

d i s c r e t e r a n d o m v a r i a b l e s . U n f o r t u n a t e l y , t h e d e t e r m i n i s t i c g e o m e t r i c p r o g r a m e q u i v a l e n t f o r t h e s e

p r o b l e m s i s s u c h t h a t t h e c o m p u t a t i o n a l b u r d e n i n s o l v i n g t h e m i s o f t e n q u i t e p r o h i b i t i v e . C o n s e q u e n t l y ,

W i e b k i n g [ 1 2] d e v e l o p s m e t h o d s f o r c a l c u l a t in g a p p r o x i m a t e s o l u t i o n s u s i n g u p p e r a n d l o w e r b o u n d s o n

t h e m i n i m u m e x p e c t e d v a l u e o f t h e o b j e c t i v e f u n c t i o n .

H o w e v e r , b y f o r m u l a t i n g t h e g e n e r a l S G P m o d e l a s a m u l t i p l i c a t i v e r e c o u r s e m o d e l w e s h o w t h a t t h e

d e t e r m i n i s t i c e q u i v a l e n t p r o b l e m c a n b e s o l v e d as a c o n v e x p r o g r a m . T h e r e s u l t s o f th i s p a p e r c a n t h e n b e

s p e c ia l iz e d t o t h e p r o b l e m o f d e s i g n i n g a c o n d e n s i n g s y s t e m , w h i c h i s s t a t e d i n [1 2].

2 . S G P m o d e l f o r m u l a t i o n

W e s t a rt w i t h t h e d e t e rm i n i s ti c g e o m e tr ic p r o g r a m m i n g m o d e l :

M i n i m i z e g o ( x ) = x o

ri

s . t . g i ( x ) = ~ _, c i j p i j ( x ) <~ 1 , i = 1 . . . . . m ,j = l

x , > 0 , k = 0 , 1 . . . . . n ,

w h e r e

a n d

c u > O , p ~ j ( x ) = f i '~ 'J *k ,

k= O

(1 )

a o k E R , i = 0 , 1 . . . . . m , j = l . . . . . r i , k = 0 , 1 . . . . . n .

T h e c o n s t r a i n t f u n c t i o n g i ( x ) a r e c a l l e d p o s y n o m i a l s [ 8 ] .

T h e d u a l o f ( 1 ) i sm

M a x i m i z e V I ( c i j / ~ i j ) I - I ) ~ x / (2 )i , j i = 0

s . t . E S i j = X i , i = O , 1 . . . . . m ,

J

Y '~ a k ~ j S i j = O , k = O , 1 . . . . . n ,i~Oj=l

8 ij > ~ O , • o = 1 , ~ > ~ 0 , i = O , 1 . . . . , m , j = l . . . . . rs.

I f x * a n d ( h * , 8 * ) a r e re s p e c ti v e l y o p t i m a l s o l u t i o n s f o r ( 1) a n d ( 2 ), t h e n t h e y a r e r e l a te d b y t h e f o l lo w i n g

e qua t i ons ( s e e [4 ] ) :

x, '¢ , : ,j (x*)/g , ( x * ) =

100

8/6/2019 Stochastic GP With Multiplicative Recourse

http://slidepdf.com/reader/full/stochastic-gp-with-multiplicative-recourse 3/6

Volume 9 , Number 2 OPERATIONS RESEARCH LETTERS March 1990

T h u s 0 ~ = 8, j/ ) ~; r e p r e s e n t s t h e re l a ti v e c o n t r i b u t i o n o f t h e o p t i m a l v a l u e o f th e j - t h t e r m i n r e l a t i o n t o

t h e o p t i m a l v a l u e o f t h e p o s y n o m i a l , g ~ ( x * ) . T h e n 5 " . j 0 ~ = 1 .

S G P mo d e l i n te r p re t a ti o n

W e m a k e t h e f o l l o w i n g a s s u m p t i o n s r e g a r d i n g t h e s t o c h a s t i c n a t u r e o f c~ j a n d a ~/~ o f (1 ) .

( A 1 ) L e t c~ = (c~1 . . . . c ~ ,) , i = 1 . . . . . m , b e a n r ~ - d im e n s i o n a l p o s i t i v e r a n d o m v e c t o r w i t h a k n o w n j o i n t

d i s t r i b u t i o n f u n c t i o n F ~, i .e . , F / ( t ) = P ( c , ~ t ) . L e t Ec~ = ~/~, w h er e 17~ I < ~ -

( A 2 ) L e t a , / = ( a i j a . . . . a ~ jn ) b e a n n - d i m e n s i o n a l v e c t o r w i t h a k n o w n j o i n t d i s t r i b u ti o n f u n c t i o n

G i j ( s ) = P ( a i j ~ s ) f o r a l l ( i , j ) . L e t E a i j = I£ij, w h e r e [l~ij [ < oo.

( A 3 ) ( cg } a n d { ai j } a r e i n d e p e n d e n t r a n d o m v a r i a b l es .

L e t t h e des ign var iab les ( f i rs t s t a g e d e c i s i o n v a r i a b l e s ) o f t h e m o d e l b e x k , k = 0 , 1 . . . . . m , a n d O~j,

j = 1 . . . . . r~ a n d i = 1 . . . . m . H e r e O~j r e p r e s e n t s t h e r e l at iv e c o n t r i b u t i o n o f t h e j - t h m o n o m i a l t e r m

c ~ j p i j ( x ) i n t h e o p t i m a l s o l u t i o n i n r e l a ti o n t o t h e o p t i m a l v a l u e o f th e p o s y n o m i a l g , ( x ) . T h e n EjO~j = 1 .

L e t u s r e c a s t t h e g e o m e t r i c p r o g r a m ( 1) a s

M i n i m i z e x 0 ( 3 )

s . t . c i / P i / ( x ) O i ] 1 ~< 1 ,

( i = l . . . . . m; j i = l . . . . . r )

E O , / = 1 ,

J

x ~ > 0 , k = 0 , 1 . . . . . n .

T h e d e s i g n e n g i n e e r c h o o s e s t h e d e s i g n v a r i a b l e s x a n d 8 ~ j f i r s t a n d t h e n o b s e r v e s t h e r a n d o m v a r i a b l e s

( C i ) a n d { a i j ).

I t is c l e a r t h a t t h e f i r s t s t a g e d e c i s i o n v a r i a b l e s x a n d Oij c a n n o t b e d e t e r m i n e d i n a d v a n c e i n su c h a

w a y t h a t t h e c o n s t r a i n t s , c , j p, j ( x )O ~ ] a ~< 1 a r e s a t i s f i e d w i t h p r o b a b i l i t y o n e , w h e r e x = ( X o , X 1 . . . . x n ) .

L e t t h e o b s e r v e d v a l u e s o f c ~ a n d a i j b e c i = ?i a nd a~j = a i j . T h e n d e f i n e f f i j ( x ) = l - l ~ = o X k ~ i /k .

W e n e e d t h e o p e r a t i n g v a r i a b l e ( s e c o n d s t a g e r e c o u r s e v a r i a b l e ) t g j t o c o r r e c t p o s s i b l e v i o l a t i o n o f t h ec o n s t r a i n t s ( 3 ) . S p e c i f i c a l l y , l e t

t i j = [ ~ i j P i j ( x ) O i - j l ] , (4 )

N o t e t h a t t i j ~< 1 if a n d o n l y i f t h e r e i s n o n e e d f o r a n y c o r r e c t i v e a c t i o n . A l s o t , / > 1 r e p r e s e n t s i n a

p r o p o r t i o n a l s e n s e t h e a m o u n t o f v i o l a t io n o f t h e c o n s t r a i n t s ( 3 ) . C l e a r l y t h e c o s t q ~ (t~ j) o f t a k i n g t h e

c o r r e c t i v e a c t i o n tg j s h o u l d s a t i s f y t h e f o l l o w i n g p r o p e r t i e s :

(i ) q~(t~j) -- 0 i f t~j ~< 1 , a n d

( i i ) ~ ( t ~ / ) i n c r e a s e s a s t ~ j i n c r e a s e s .

I n t h i s p a p e r , w e a s s u m e t h e f o l l o w i n g p a r t i c u l a r p e n a l t y f u n c t i o n : q > (t ,j ) = a i j [ l n ( t , j ) ] +, w h e r e a ~j > 0 f o r

a l l i , j , a n d [ u] + = m a x ( u , 0) . T h e n t h e e x p e c t e d v a l u e o f t h e p e n a l t y c o s t d u e t o t a k i n g s e c o n d s t a g e

c o r r e c t i v e a c t i o n i s E ( a ~ j [ l n ( c ~ j p ~ j ( x ) O ~ ) ] + ) , w h e r e t h e e x p e c t a t i o n E i s w i t h r e s p e c t to t h e r a n d o m

v a r i a b l e s c~j and a i j k .

N o w w e a r e i n a p o s i t i o n t o s t a t e t h e S G P m o d e l w i t k m u l t i p l i c a t i v e r e c o u r s e :

x o + Y ' ~ E { a , j [ l n ( c , j p , j ( x ) O g j a ) ] + ) (5 )i n i m i z ex,O i,j

s . t . E ( E c i j p i j ( x ) ) ~ < 1 , i = 1 . . . . , m , ( 6)- j

EO,+=I, i = 1 . . . . . m ,

J

O~j >~O, j - - 1 . . . . . r~, i = 1 . . . . . m ,

x k > 0 , k = 0 , 1 . . . . . n .

101

8/6/2019 Stochastic GP With Multiplicative Recourse

http://slidepdf.com/reader/full/stochastic-gp-with-multiplicative-recourse 4/6

Volume 9, Num ber 2 OPERATION S RESEAR CH LETTERS March 1990

N o t e t h a t c i j P i j ( X ) ~ CijI - IkX~ '# . Th e e x p e c t a t i o n o p e r a t o r E i n (5 ) a n d ( 6 ) i s w i t h r e s p e c t t o t h e r a n d o m

v a r i a b l e s ( c i j ~ } a n d { a i j k } . T h e c o n s t r a i n t s ( 6 ) a r e i n t r o d u c e d t o e n s u r e t h a t f o r a n y f e a s i b l e c h o i c e o f x

t h e a v e r a g e v a l u e s o f t h e p o l y n o m i a l s a r e l e s s t h a n o r e q u a l t o o n e .

D e f i n e

1 +q , j ( x , O i + ) = E [ i n ( c , j p i / ( x ) O i S ' ) ] + = E [ l n £i j + } 7 _ , a i j k h i x ~ - l n 0i. , , ( 7 )[ k

E [ E c ~ j p i j ( x ) ] = E T i j E ( e E k a ' / k l n x k ) = E y i j M i j ( l n x o . . . . . I n x n ) , ( 8 )

t + / J J

w h e r e ~ 'i j = E c q > 0 , a n d

M i j ( t 1 . . . . t , ) = e ( e ~ktka'+ k } ( 9 )

i s t h e m o m e n t g e n e r a t i n g f u n c t i o n o f th e k - v e c t o r a i j . T h e r e s u l t ( 8 ) f o l l o w s f r o m ( A 3 ) .

T h e d e t e r m i n i s t i c e q u i v a l e n t m o d e l ( 5 ) c a n b e r e c a s t a s

M i n i m i z e x o + ~ . a i j ~ / i j ( X o . . . . . x , , O i j) ( 1 0 )x , O i , j

s . t . Z Y i j M i j ( l n x 0 . . . . . I n X , ) ~< 1 , i = 1 . . . . . m ,

J

~ . , O i j = l , O ij> ~ O , x k > 0 f o r a l l ( i , j , k ) .

J

L e t t i n g z k = I n x k , k = 0 ,1 . . . . . n , w e h a v e t h e f o l l o w i n g e q u i v a l e n t n o n l i n e a r p r o g r a m , w h o s e d e c i s i o n

v e c t o r i s ( z , 0 ) :+

M i n i m i z e,0 eZ° + E etiJE [ In cij + E a ijkZk - ln Oij ( 1 1 )

s . t . Y ; v , j M i + ( Z o . . . . . z . ) < l , i = 1 . . . . . m ,J

E S q = l , O q > l O f o r a l l ( i , j ) .

J

T h e o r e m 1 . P r o b l e m ( 1 1 ) i s a c o n v e x p r o g r a m in ( z , 0 ) .

P r o o f . B y d e f i n i t io n , t h e m o m e n t g e n e r a t i n g f u n c t i o n i s c o n v e x in ( z , 0 ) . A l s o , si n c e OLij > 0 , t h e o b j e c t i v e

f u n c t i o n c a n b e e a s i ly v e r i f i e d t o b e c o n v e x i n ( z , 0 ) . [ ]

R e m a r k 1 . P r o b l e m ( 1 1 ), b e i n g a c o n v e x p r o g r a m , h a s t h e d e s i r a b l e p r o p e r t y t h a t a l o c a l m i n i m u m i s a l s o a

g l o b a l m i n i m u m . I f t h e d i s t r i b u t i o n f u n c t i o n s F a n d G a r e a b s o l u t e l y c o n t i n u o u s , t h e n t h e o b j e c t i v ef u n c t i o n o f ( 1 1 ) i s a ls o c o n t i n u o u s l y d i f f e r e n t i a b l e .

R e m a r k 2 . A c o n v e n i e n t s e t o f a s s u m p t i o n s , w h i c h w e m a k e i n S e c t i o n 3 r e g a r d i n g t h e s t o c h a s ti c n a t u r e o f

c i j a n d a i j k , i s t h a t { I n c ij } a n d { aij t , } a r e n o r m a l l y d i s t ri b u t e d w i t h k n o w n m e a n v e c t o r s a n d c o v a r i a n c e

m a t r i c e s .

R e m a r k 3 . S u p p o s e In c i j a n d a i j -~ ( a i j 1 . . . . a i j n ) h a v e a j o i n t discre te d i s t r i b u t i o n .

S p e c i fi c a ll y , f o r a l l ( i , j ) , P r ( l n c i j - - l n c i j q , a i / = a q j ) = ¢ r i q j , w h e r e

Z ff/'iq= 1 , $'riq ~ 0 , q = l . . . . . n i j .q

102

8/6/2019 Stochastic GP With Multiplicative Recourse

http://slidepdf.com/reader/full/stochastic-gp-with-multiplicative-recourse 5/6

V o l u m e 9 , N u m b e r 2 O P E R A T I O N S R E S E A R C H L E T T E R S M a r c h 1 9 90

T h e n P r o b l e m ( 1 1 ) r e d u c e s t o t h e convex separab le p r o g r a m

M i n i m i z e e Z ° + ~ (a i jY '~ 7 r i q w i j - q ) ( 1 2 )

t , j q "

s . t . In Cijq + E a q j k z k In 0 i j + Wijq - Wi jq = 0 for a l l ( i , j , q ) , (13)

E('Yij'r'l'iqeZ'*aq'J*z*)<~l, i = 1 . . . . . m , ( 1 4 )J,q

E 0 ~j = 1 fo r a l l i , ( 1 5 )

J

0 i j > / 0 f o r a l l ( i , j ) , ( 1 6 )

wi ]q , w~7 >1 0 f o r a l l ( i , j , q ) , ( 1 7 )

w h e r e 7 q = ~~qClriqcijq.P r o b l e m ( 1 2 ) c a n b e s o l v e d u s i n g a n a p p r o x i m a t e L P p r o b l e m ( s e e B a z a r a a a n d S h e t t y [ 4 ] , p p .

4 5 3 - 4 7 1 ) . A g o o d s t a r t i n g s o l u t i o n i s o b t a i n e d b y m i n i m i z i n g t h e o b j e c t i v e f u n c t i o n ( 1 2 ) s u b j e c t t o ( 1 3 ) ,

( 1 5) , (1 6 ) a n d ( 1 7) . B e c a u s e o f t h e n a t u r e o f t h e p e n a l t y c o s t s i n ( 12 ) , s e v e ra l o f t h e c o n s t r a i n t s i n ( 1 4) a r e

e x p e c t e d t o b e s a t i s f i e d a u t o m a t i c a l l y f o r t h e a b o v e s t a r t i n g s o l u t i o n .

3 . A s p e c i a l c a s e

W e n o w m a k e t h e f o l l o w i n g s p e c i f i c a s s u m p t i o n s r e g a r d i n g t h e d i s t r i b u t i o n s F a n d G , w h i c h a r e i n

a d d i t i o n t o t h e A s s u m p t i o n ( A 3 ) s t a t e d e a r l i e r .

( A 4 ) T h e r a n d o m v a r ia b l e s ln { c i j } a r e n o r m a l l y d i s t r i b u t e d w i t h m e a n m q a n d v a r i a n c e s 2 .

( A 5 ) T h e r a n d o m v a r i a b l e s ai j = { a i j k } h a v e a m u l t i v a r i a te n o r m a l d i s t r i b u t i o n w i t h m e a n t ' i / = { # i /k }

a n d c o v a r i a n c e m a t r i x V q .

I n t h i s c a s e t h e r a n d o m v a r i a b l e l n c i j + Y . k a i j k z k - - l n O q h a s a n o r m a l d i s t r i b u t i o n w i t h m e a nI~ij(Z, Oij = mij "4 - ~ . ~ k P i j k Z k - - l n O i j a n d v a r i a n c e o 2 ( z ) = s 2 + z ' V i j z , w h e r e z ' = ( Z o , Z 1 . . . . z , ) . T h e n w e

c a n d e r i v e t h e f o l l o w i n g r e s u l t s :

~ i j ( Z ' O i j ) = E [ l n C i j q - E a i j k Z k - In Oij ] +

= l , i j ( z , O i j ) [ 1 - N ( - l a i j ( z , O i j ) / O i j ( Z ) ) ] + % ( z ) [ n ( • , , ( z , O , ,) / % ( z ) ) ] ,

w h e r e

N ( t ) = f ' e - : = / 2 d u / 2 ¢ ~ ,- - 0 0

v , , = e I c . ] =

1 2- - e x p ( m i j + i $ , j ),

S o P r o b l e m ( 1 1 ) r e d u c e s t o t h e c o n v e x p r o g r a m

M inim ize e ~° + E a i j ~ i j ( Z , O i j )z , O i , j

P 1 ts . t . Y' . e x p ( m i j + ½ s ~ + z # i j + ~ z V q z ) < l ,

J

Y ' O i j = l , O ij> ~O f o r a l l ( i , j ) ,

J

w h e r e ¢ ( . ) i s d e f i n e d i n (1 8 ).

n ( t ) = e - ' 2 / 2 / 2 ~ '

l 1 PM i j ( z ) = e x p ( z # i j + ~ z V q z ) .

i = l , . . . , m ,

( 1 8 )

( 1 9 )

(20)

10 3

8/6/2019 Stochastic GP With Multiplicative Recourse

http://slidepdf.com/reader/full/stochastic-gp-with-multiplicative-recourse 6/6

Vol ume 9 , Num ber 2 OPER ATION S RESEARCH LETTERS March 1990

C o m p u t a t i o n a l c o n s id e r a ti o n s

D e n o t e t h e o b j e c t iv e f u n c t i o n o f P r o b l e m ( 1 9) a s H ( z , 8 ) a n d t h e c o n s t r a i n t f u n c t i o n s i n (2 0 ) a s g i ( z ) .

T h e n t he c o n v e x p r o g r a m ( 18 ) c a n b e s t a te d a s

M i n i m i z e H ( z , 8 ) ( 2 1 )

s . t . g i ( z ) < ~ l , i = l . . . . . m ,

F . , o , + = 1 , a , j > i o fo r a l l ( i , j ) . ( 2 2 )

W e n o t e t h a t H ( z , 8 ) a n d g i ( z ) a r e c o n t i n u o u s l y d i f f e r e n ti a b l e a n d c o n v e x f u n c t i o n s o f z ~ R " ÷ 1 a n d

8 ~ R ~ r' G i v e n t h e s t a n d a r d n o r m a l t a b l e v a l u e s o f t h e f u n c t i o n s N ( t ) a n d n ( t ) , t h e n u m b e r o f a r i t h m e t i c.

o p e r a t i o n s n e e d e d t o c o m p u t e t h e fu n c t i o n a l v a lu e s o f H ( z , 8 ) a n d t h e g r a d i e n t s V z H ( z , O ), V o H ( z , 8 )

a n d x T ~ g i ( z ) i s n o t m u c h .

T h e e x p r e s s i o n s f o r t h e g r a d i e n t s a r e a s f o ll o w s :

0 0 , j 0 , j ) = 1 ] / 0 , j ,

0 , ; ) = [ 1 - +

V z H ( Z , O ) = ( e z ° 0 0 * * . O ) T - l - E u t i j V z ~ i j ( Z , O i j ) ,i , j

OH (z, O) 0 , + )80 i j = a i j ~ )Oij

T h e g r a d ie n t s V : g i ( z ) c a n b e e a s il y d e r iv e d .

T h e r e a r e s e v e ra l fe a s i bl e d i r e c t io n m e t h o d s a v a i l a b le f o r s o l v i n g P r o b l e m ( 21 ). F o r e x a m p l e , t h e

m e t h o d o f R o s e n a n d K r e u s e r, w h i c h u se s a p e n a l t y f u n c t i o n - L a g r a n g i a n a p p r o a c h a n d h a s a q u a d r a t ic

r a t e o f c o n v e r g e n c e , o r t h e g e n e r a l i z e d r e d u c e d g r a d i e n t m e t h o d s e e m s t o b e a p p r o p r i a t e . S e e p . 4 5 3 a n d

p p . 4 7 4 - 4 7 7 o f A v r i e l [3 ] f o r d e ta i ls . A s w e s t a t e d e a r h e r , a g o o d s t a r t in g s o l u t i o n c a n b e o b t a i n e d b ym i n i m i z i n g ( 2 1 ) s u b j e c t t o t h e l i n e a r c o n s t r a i n t s ( 2 2 ) .

G i v e n a n o p t i m a l s o l u t i o n f o r ( 21 ), a n o p t i m a l s o l u t i o n f o r t h e d e t e r m i n i s t i c e q u i v a l e n t m o d e l ( 1 0 ) c a n

b e d e r i v e d u s i n g t h e t r a n s f o r m a t i o n x k = e ~*.

R e f e r e n c e s

[1] M. Avriel, M.J. Rijkaert and D.J. Wilde (eds.), Optimization and Design, Prentice-Hall, N J, 1973.[2] M. Avriel and D.J. Wilde, "Stochastic geometric programming", in: Proceedings of the P rinceton Symposium on M athematical

Programming, H. K uhn (ed.), Princeton University Press, Princeton, NJ, 1970, 73-89.[3] M. Avriel, N onl inear P rogramming, Prentice-Hall, 1976.

[4] M.S. Bazaraa and C .M . Shetty, N onl inear P rogramming, Wiley, 1979.[5] C. Beightler and D.T. Phillips, Applied G eometric Program ming, Wiley, 1976.[6] A. Ch arnes, W .W . Cooper , B. Golany a nd J . Masters , "Opt im al design m odifications by geometr ic programming and

constrained stochastic network m odels", Internat. J. Systems Sci. 19 (6), 825-899 (1988).[7] G.B . Dantzig, Linear P rogramming and E xtensions, Princeton University Press, NJ, 1963.[8] R.J. Duffin, E.L . Peterson and C. Zener, G eometric Programming, Theory and Applications, Wiley, 1967.[9] J.G. Ecker and R .D. W iebking, "O ptim al selection of stream turbine e xhaust annulus and condenser siz es by geom etric

programming", Engineering O ptimization 2, 173-181 (1976).[10] R. Jagannathan, "U se of sample information in stochastic recourse and chance constrained program ming m odels", Management

Sci. 31, 96-108 (1985).[11] R.J.B. W ets, "Programm ing under unce rtainty: The equivalent convex program", S I A M 14, 89-105 (1966).[12] R. P. Wiebking, "Optim al eng ineering design under unce rtainty", Managem ent Sci. 6, 644-651 (1977).

10 4