ÿþ<html xmlns:v="urn:schemas-microsoft-com:vml" xmlns:o="urn:schemas-microsoft-com:office:office" xmlns:w="urn:schemas-microsoft-com:office:word" xmlns:m="http://schemas.microsoft.com/office/2004/12/omml" xmlns="http://www.w3.org/TR/REC-html40"> <head> <meta http-equiv=Content-Type content="text/html; charset=unicode"> <meta name=ProgId content=Word.Document> <meta name=Generator content="Microsoft Word 12"> <meta name=Originator content="Microsoft Word 12"> <link rel=File-List href="frame2_files/filelist.xml"> <link rel=Edit-Time-Data href="frame2_files/editdata.mso"> <!--[if !mso]> <style> v\:* {behavior:url(#default#VML);} o\:* {behavior:url(#default#VML);} w\:* {behavior:url(#default#VML);} .shape {behavior:url(#default#VML);} </style> <![endif]--> <title> Andrzej RuszczyDski </title> <!--[if gte mso 9]><xml> <o:DocumentProperties> <o:Author>Andrzej Ruszczynski</o:Author> <o:Template>Normal</o:Template> <o:LastAuthor>Andrzej Ruszczynski</o:LastAuthor> <o:Revision>5</o:Revision> <o:TotalTime>9</o:TotalTime> <o:Created>2011-08-19T01:40:00Z</o:Created> <o:LastSaved>2011-12-22T22:34:00Z</o:LastSaved> <o:Pages>3</o:Pages> <o:Words>4074</o:Words> <o:Characters>23226</o:Characters> <o:Lines>193</o:Lines> <o:Paragraphs>54</o:Paragraphs> <o:CharactersWithSpaces>27246</o:CharactersWithSpaces> <o:Version>12.00</o:Version> </o:DocumentProperties> </xml><![endif]--> <link rel=themeData href="frame2_files/themedata.thmx"> <link rel=colorSchemeMapping href="frame2_files/colorschememapping.xml"> <!--[if gte mso 9]><xml> <w:WordDocument> <w:Zoom>BestFit</w:Zoom> <w:SpellingState>Clean</w:SpellingState> <w:GrammarState>Clean</w:GrammarState> <w:TrackMoves>false</w:TrackMoves> <w:TrackFormatting/> <w:ValidateAgainstSchemas/> <w:SaveIfXMLInvalid>false</w:SaveIfXMLInvalid> <w:IgnoreMixedContent>false</w:IgnoreMixedContent> <w:AlwaysShowPlaceholderText>false</w:AlwaysShowPlaceholderText> <w:DoNotPromoteQF/> <w:LidThemeOther>EN-US</w:LidThemeOther> <w:LidThemeAsian>X-NONE</w:LidThemeAsian> <w:LidThemeComplexScript>X-NONE</w:LidThemeComplexScript> <w:Compatibility> <w:BreakWrappedTables/> <w:SnapToGridInCell/> <w:WrapTextWithPunct/> <w:UseAsianBreakRules/> <w:DontGrowAutofit/> <w:SplitPgBreakAndParaMark/> <w:DontVertAlignCellWithSp/> <w:DontBreakConstrainedForcedTables/> <w:DontVertAlignInTxbx/> <w:Word11KerningPairs/> <w:CachedColBalance/> </w:Compatibility> <w:BrowserLevel>MicrosoftInternetExplorer4</w:BrowserLevel> <m:mathPr> <m:mathFont m:val="Cambria Math"/> <m:brkBin m:val="before"/> <m:brkBinSub m:val="&#45;-"/> <m:smallFrac m:val="off"/> <m:dispDef/> <m:lMargin m:val="0"/> <m:rMargin m:val="0"/> <m:defJc m:val="centerGroup"/> <m:wrapIndent m:val="1440"/> <m:intLim m:val="subSup"/> <m:naryLim m:val="undOvr"/> </m:mathPr></w:WordDocument> </xml><![endif]--><!--[if gte mso 9]><xml> <w:LatentStyles DefLockedState="false" DefUnhideWhenUsed="true" DefSemiHidden="true" DefQFormat="false" DefPriority="99" LatentStyleCount="267"> <w:LsdException Locked="false" Priority="0" SemiHidden="false" UnhideWhenUsed="false" QFormat="true" Name="Normal"/> <w:LsdException Locked="false" Priority="9" SemiHidden="false" UnhideWhenUsed="false" QFormat="true" Name="heading 1"/> <w:LsdException Locked="false" Priority="9" QFormat="true" Name="heading 2"/> <w:LsdException Locked="false" Priority="9" QFormat="true" Name="heading 3"/> <w:LsdException Locked="false" Priority="9" SemiHidden="false" UnhideWhenUsed="false" QFormat="true" Name="heading 4"/> <w:LsdException Locked="false" Priority="9" SemiHidden="false" UnhideWhenUsed="false" QFormat="true" Name="heading 5"/> <w:LsdException Locked="false" Priority="9" QFormat="true" Name="heading 6"/> <w:LsdException Locked="false" Priority="9" QFormat="true" Name="heading 7"/> <w:LsdException Locked="false" Priority="9" QFormat="true" Name="heading 8"/> <w:LsdException Locked="false" Priority="9" QFormat="true" Name="heading 9"/> <w:LsdException Locked="false" Priority="39" Name="toc 1"/> <w:LsdException Locked="false" Priority="39" Name="toc 2"/> <w:LsdException Locked="false" Priority="39" Name="toc 3"/> <w:LsdException Locked="false" Priority="39" Name="toc 4"/> <w:LsdException Locked="false" Priority="39" Name="toc 5"/> <w:LsdException Locked="false" Priority="39" Name="toc 6"/> <w:LsdException Locked="false" Priority="39" Name="toc 7"/> <w:LsdException Locked="false" Priority="39" Name="toc 8"/> <w:LsdException Locked="false" Priority="39" Name="toc 9"/> <w:LsdException Locked="false" Priority="35" QFormat="true" Name="caption"/> <w:LsdException Locked="false" Priority="10" SemiHidden="false" UnhideWhenUsed="false" QFormat="true" Name="Title"/> <w:LsdException Locked="false" Priority="1" Name="Default Paragraph Font"/> <w:LsdException Locked="false" Priority="11" SemiHidden="false" UnhideWhenUsed="false" QFormat="true" Name="Subtitle"/> <w:LsdException Locked="false" Priority="22" SemiHidden="false" UnhideWhenUsed="false" QFormat="true" Name="Strong"/> <w:LsdException Locked="false" Priority="20" SemiHidden="false" UnhideWhenUsed="false" QFormat="true" Name="Emphasis"/> <w:LsdException Locked="false" Priority="59" SemiHidden="false" UnhideWhenUsed="false" Name="Table Grid"/> <w:LsdException Locked="false" UnhideWhenUsed="false" Name="Placeholder Text"/> <w:LsdException Locked="false" Priority="1" SemiHidden="false" UnhideWhenUsed="false" QFormat="true" Name="No Spacing"/> <w:LsdException Locked="false" Priority="60" SemiHidden="false" UnhideWhenUsed="false" Name="Light Shading"/> <w:LsdException Locked="false" Priority="61" SemiHidden="false" UnhideWhenUsed="false" Name="Light List"/> <w:LsdException Locked="false" Priority="62" SemiHidden="false" UnhideWhenUsed="false" Name="Light Grid"/> <w:LsdException Locked="false" Priority="63" SemiHidden="false" UnhideWhenUsed="false" Name="Medium Shading 1"/> <w:LsdException Locked="false" Priority="64" SemiHidden="false" UnhideWhenUsed="false" Name="Medium Shading 2"/> <w:LsdException Locked="false" Priority="65" SemiHidden="false" UnhideWhenUsed="false" Name="Medium List 1"/> <w:LsdException Locked="false" Priority="66" SemiHidden="false" UnhideWhenUsed="false" Name="Medium List 2"/> <w:LsdException Locked="false" Priority="67" SemiHidden="false" UnhideWhenUsed="false" Name="Medium Grid 1"/> <w:LsdException Locked="false" Priority="68" SemiHidden="false" UnhideWhenUsed="false" Name="Medium Grid 2"/> <w:LsdException Locked="false" Priority="69" SemiHidden="false" UnhideWhenUsed="false" Name="Medium Grid 3"/> <w:LsdException Locked="false" Priority="70" SemiHidden="false" UnhideWhenUsed="false" Name="Dark List"/> <w:LsdException Locked="false" Priority="71" SemiHidden="false" UnhideWhenUsed="false" Name="Colorful Shading"/> <w:LsdException Locked="false" Priority="72" SemiHidden="false" UnhideWhenUsed="false" Name="Colorful List"/> <w:LsdException Locked="false" Priority="73" SemiHidden="false" UnhideWhenUsed="false" Name="Colorful Grid"/> <w:LsdException Locked="false" Priority="60" SemiHidden="false" UnhideWhenUsed="false" Name="Light Shading Accent 1"/> <w:LsdException Locked="false" Priority="61" SemiHidden="false" UnhideWhenUsed="false" Name="Light List Accent 1"/> <w:LsdException Locked="false" Priority="62" SemiHidden="false" UnhideWhenUsed="false" Name="Light Grid Accent 1"/> <w:LsdException Locked="false" Priority="63" SemiHidden="false" UnhideWhenUsed="false" Name="Medium Shading 1 Accent 1"/> <w:LsdException Locked="false" Priority="64" SemiHidden="false" UnhideWhenUsed="false" Name="Medium Shading 2 Accent 1"/> <w:LsdException Locked="false" Priority="65" SemiHidden="false" UnhideWhenUsed="false" Name="Medium List 1 Accent 1"/> <w:LsdException Locked="false" UnhideWhenUsed="false" Name="Revision"/> <w:LsdException Locked="false" Priority="34" SemiHidden="false" UnhideWhenUsed="false" QFormat="true" Name="List Paragraph"/> <w:LsdException Locked="false" Priority="29" SemiHidden="false" UnhideWhenUsed="false" QFormat="true" Name="Quote"/> <w:LsdException Locked="false" Priority="30" SemiHidden="false" UnhideWhenUsed="false" QFormat="true" Name="Intense Quote"/> <w:LsdException Locked="false" Priority="66" SemiHidden="false" UnhideWhenUsed="false" Name="Medium List 2 Accent 1"/> <w:LsdException Locked="false" Priority="67" SemiHidden="false" UnhideWhenUsed="false" Name="Medium Grid 1 Accent 1"/> <w:LsdException Locked="false" Priority="68" SemiHidden="false" UnhideWhenUsed="false" Name="Medium Grid 2 Accent 1"/> <w:LsdException Locked="false" Priority="69" SemiHidden="false" UnhideWhenUsed="false" Name="Medium Grid 3 Accent 1"/> <w:LsdException Locked="false" Priority="70" SemiHidden="false" UnhideWhenUsed="false" Name="Dark List Accent 1"/> <w:LsdException Locked="false" Priority="71" SemiHidden="false" UnhideWhenUsed="false" Name="Colorful Shading Accent 1"/> <w:LsdException Locked="false" Priority="72" SemiHidden="false" UnhideWhenUsed="false" Name="Colorful List Accent 1"/> <w:LsdException Locked="false" Priority="73" SemiHidden="false" UnhideWhenUsed="false" Name="Colorful Grid Accent 1"/> <w:LsdException Locked="false" Priority="60" SemiHidden="false" UnhideWhenUsed="false" Name="Light Shading Accent 2"/> <w:LsdException Locked="false" Priority="61" SemiHidden="false" UnhideWhenUsed="false" Name="Light List Accent 2"/> <w:LsdException Locked="false" Priority="62" SemiHidden="false" UnhideWhenUsed="false" Name="Light Grid Accent 2"/> <w:LsdException Locked="false" Priority="63" SemiHidden="false" UnhideWhenUsed="false" Name="Medium Shading 1 Accent 2"/> <w:LsdException Locked="false" Priority="64" SemiHidden="false" UnhideWhenUsed="false" Name="Medium Shading 2 Accent 2"/> <w:LsdException Locked="false" Priority="65" SemiHidden="false" UnhideWhenUsed="false" Name="Medium List 1 Accent 2"/> <w:LsdException Locked="false" Priority="66" SemiHidden="false" UnhideWhenUsed="false" Name="Medium List 2 Accent 2"/> <w:LsdException Locked="false" Priority="67" SemiHidden="false" UnhideWhenUsed="false" Name="Medium Grid 1 Accent 2"/> <w:LsdException Locked="false" Priority="68" SemiHidden="false" UnhideWhenUsed="false" Name="Medium Grid 2 Accent 2"/> <w:LsdException Locked="false" Priority="69" SemiHidden="false" UnhideWhenUsed="false" Name="Medium Grid 3 Accent 2"/> <w:LsdException Locked="false" Priority="70" SemiHidden="false" UnhideWhenUsed="false" Name="Dark List Accent 2"/> <w:LsdException Locked="false" Priority="71" SemiHidden="false" UnhideWhenUsed="false" Name="Colorful Shading Accent 2"/> <w:LsdException Locked="false" Priority="72" SemiHidden="false" UnhideWhenUsed="false" Name="Colorful List Accent 2"/> <w:LsdException Locked="false" Priority="73" SemiHidden="false" UnhideWhenUsed="false" Name="Colorful Grid Accent 2"/> <w:LsdException Locked="false" Priority="60" SemiHidden="false" UnhideWhenUsed="false" Name="Light Shading Accent 3"/> <w:LsdException Locked="false" Priority="61" SemiHidden="false" UnhideWhenUsed="false" Name="Light List Accent 3"/> <w:LsdException Locked="false" Priority="62" SemiHidden="false" UnhideWhenUsed="false" Name="Light Grid Accent 3"/> <w:LsdException Locked="false" Priority="63" SemiHidden="false" UnhideWhenUsed="false" Name="Medium Shading 1 Accent 3"/> <w:LsdException Locked="false" Priority="64" SemiHidden="false" UnhideWhenUsed="false" Name="Medium Shading 2 Accent 3"/> <w:LsdException Locked="false" Priority="65" SemiHidden="false" UnhideWhenUsed="false" Name="Medium List 1 Accent 3"/> <w:LsdException Locked="false" Priority="66" SemiHidden="false" UnhideWhenUsed="false" Name="Medium List 2 Accent 3"/> <w:LsdException Locked="false" Priority="67" SemiHidden="false" UnhideWhenUsed="false" Name="Medium Grid 1 Accent 3"/> <w:LsdException Locked="false" Priority="68" SemiHidden="false" UnhideWhenUsed="false" Name="Medium Grid 2 Accent 3"/> <w:LsdException Locked="false" Priority="69" SemiHidden="false" UnhideWhenUsed="false" Name="Medium Grid 3 Accent 3"/> <w:LsdException Locked="false" Priority="70" SemiHidden="false" UnhideWhenUsed="false" Name="Dark List Accent 3"/> <w:LsdException Locked="false" Priority="71" SemiHidden="false" UnhideWhenUsed="false" Name="Colorful Shading Accent 3"/> <w:LsdException Locked="false" Priority="72" SemiHidden="false" UnhideWhenUsed="false" Name="Colorful List Accent 3"/> <w:LsdException Locked="false" Priority="73" SemiHidden="false" UnhideWhenUsed="false" Name="Colorful Grid Accent 3"/> <w:LsdException Locked="false" Priority="60" SemiHidden="false" UnhideWhenUsed="false" Name="Light Shading Accent 4"/> <w:LsdException Locked="false" Priority="61" SemiHidden="false" UnhideWhenUsed="false" Name="Light List Accent 4"/> <w:LsdException Locked="false" Priority="62" SemiHidden="false" UnhideWhenUsed="false" Name="Light Grid Accent 4"/> <w:LsdException Locked="false" Priority="63" SemiHidden="false" UnhideWhenUsed="false" Name="Medium Shading 1 Accent 4"/> <w:LsdException Locked="false" Priority="64" SemiHidden="false" UnhideWhenUsed="false" Name="Medium Shading 2 Accent 4"/> <w:LsdException Locked="false" Priority="65" SemiHidden="false" UnhideWhenUsed="false" Name="Medium List 1 Accent 4"/> <w:LsdException Locked="false" Priority="66" SemiHidden="false" UnhideWhenUsed="false" Name="Medium List 2 Accent 4"/> <w:LsdException Locked="false" Priority="67" SemiHidden="false" UnhideWhenUsed="false" Name="Medium Grid 1 Accent 4"/> <w:LsdException Locked="false" Priority="68" SemiHidden="false" UnhideWhenUsed="false" Name="Medium Grid 2 Accent 4"/> <w:LsdException Locked="false" Priority="69" SemiHidden="false" UnhideWhenUsed="false" Name="Medium Grid 3 Accent 4"/> <w:LsdException Locked="false" Priority="70" SemiHidden="false" UnhideWhenUsed="false" Name="Dark List Accent 4"/> <w:LsdException Locked="false" Priority="71" SemiHidden="false" UnhideWhenUsed="false" Name="Colorful Shading Accent 4"/> <w:LsdException Locked="false" Priority="72" SemiHidden="false" UnhideWhenUsed="false" Name="Colorful List Accent 4"/> <w:LsdException Locked="false" Priority="73" SemiHidden="false" UnhideWhenUsed="false" Name="Colorful Grid Accent 4"/> <w:LsdException Locked="false" Priority="60" SemiHidden="false" UnhideWhenUsed="false" Name="Light Shading Accent 5"/> <w:LsdException Locked="false" Priority="61" SemiHidden="false" UnhideWhenUsed="false" Name="Light List Accent 5"/> <w:LsdException Locked="false" Priority="62" SemiHidden="false" UnhideWhenUsed="false" Name="Light Grid Accent 5"/> <w:LsdException Locked="false" Priority="63" SemiHidden="false" UnhideWhenUsed="false" Name="Medium Shading 1 Accent 5"/> <w:LsdException Locked="false" Priority="64" SemiHidden="false" UnhideWhenUsed="false" Name="Medium Shading 2 Accent 5"/> <w:LsdException Locked="false" Priority="65" SemiHidden="false" UnhideWhenUsed="false" Name="Medium List 1 Accent 5"/> <w:LsdException Locked="false" Priority="66" SemiHidden="false" UnhideWhenUsed="false" Name="Medium List 2 Accent 5"/> <w:LsdException Locked="false" Priority="67" SemiHidden="false" UnhideWhenUsed="false" Name="Medium Grid 1 Accent 5"/> <w:LsdException Locked="false" Priority="68" SemiHidden="false" UnhideWhenUsed="false" Name="Medium Grid 2 Accent 5"/> <w:LsdException Locked="false" Priority="69" SemiHidden="false" UnhideWhenUsed="false" Name="Medium Grid 3 Accent 5"/> <w:LsdException Locked="false" Priority="70" SemiHidden="false" UnhideWhenUsed="false" Name="Dark List Accent 5"/> <w:LsdException Locked="false" Priority="71" SemiHidden="false" UnhideWhenUsed="false" Name="Colorful Shading Accent 5"/> <w:LsdException Locked="false" Priority="72" SemiHidden="false" UnhideWhenUsed="false" Name="Colorful List Accent 5"/> <w:LsdException Locked="false" Priority="73" SemiHidden="false" UnhideWhenUsed="false" Name="Colorful Grid Accent 5"/> <w:LsdException Locked="false" Priority="60" SemiHidden="false" UnhideWhenUsed="false" Name="Light Shading Accent 6"/> <w:LsdException Locked="false" Priority="61" SemiHidden="false" UnhideWhenUsed="false" Name="Light List Accent 6"/> <w:LsdException Locked="false" Priority="62" SemiHidden="false" UnhideWhenUsed="false" Name="Light Grid Accent 6"/> <w:LsdException Locked="false" Priority="63" SemiHidden="false" UnhideWhenUsed="false" Name="Medium Shading 1 Accent 6"/> <w:LsdException Locked="false" Priority="64" SemiHidden="false" UnhideWhenUsed="false" Name="Medium Shading 2 Accent 6"/> <w:LsdException Locked="false" Priority="65" SemiHidden="false" UnhideWhenUsed="false" Name="Medium List 1 Accent 6"/> <w:LsdException Locked="false" Priority="66" SemiHidden="false" UnhideWhenUsed="false" Name="Medium List 2 Accent 6"/> <w:LsdException Locked="false" Priority="67" SemiHidden="false" UnhideWhenUsed="false" Name="Medium Grid 1 Accent 6"/> <w:LsdException Locked="false" Priority="68" SemiHidden="false" UnhideWhenUsed="false" Name="Medium Grid 2 Accent 6"/> <w:LsdException Locked="false" Priority="69" SemiHidden="false" UnhideWhenUsed="false" Name="Medium Grid 3 Accent 6"/> <w:LsdException Locked="false" Priority="70" SemiHidden="false" UnhideWhenUsed="false" Name="Dark List Accent 6"/> <w:LsdException Locked="false" Priority="71" SemiHidden="false" UnhideWhenUsed="false" Name="Colorful Shading Accent 6"/> <w:LsdException Locked="false" Priority="72" SemiHidden="false" UnhideWhenUsed="false" Name="Colorful List Accent 6"/> <w:LsdException Locked="false" Priority="73" SemiHidden="false" UnhideWhenUsed="false" Name="Colorful Grid Accent 6"/> <w:LsdException Locked="false" Priority="19" SemiHidden="false" UnhideWhenUsed="false" QFormat="true" Name="Subtle Emphasis"/> <w:LsdException Locked="false" Priority="21" SemiHidden="false" UnhideWhenUsed="false" QFormat="true" Name="Intense Emphasis"/> <w:LsdException Locked="false" Priority="31" SemiHidden="false" UnhideWhenUsed="false" QFormat="true" Name="Subtle Reference"/> <w:LsdException Locked="false" Priority="32" SemiHidden="false" UnhideWhenUsed="false" QFormat="true" Name="Intense Reference"/> <w:LsdException Locked="false" Priority="33" SemiHidden="false" UnhideWhenUsed="false" QFormat="true" Name="Book Title"/> <w:LsdException Locked="false" Priority="37" Name="Bibliography"/> <w:LsdException Locked="false" Priority="39" QFormat="true" Name="TOC Heading"/> </w:LatentStyles> </xml><![endif]--> <style> <!-- /* Font Definitions */ @font-face {font-family:Helvetica; panose-1:0 11 5 0 0 0 0 0 0 0; mso-font-charset:0; mso-generic-font-family:swiss; mso-font-pitch:variable; mso-font-signature:-536859905 -1073711037 9 0 511 0;} @font-face {font-family:"Cambria Math"; panose-1:2 4 5 3 5 4 6 3 2 4; mso-font-charset:1; mso-generic-font-family:roman; mso-font-format:other; mso-font-pitch:variable; mso-font-signature:0 0 0 0 0 0;} @font-face {font-family:Tahoma; panose-1:2 11 6 4 3 5 4 4 2 4; mso-font-charset:0; mso-generic-font-family:swiss; mso-font-pitch:variable; mso-font-signature:-520081665 -1073717157 41 0 66047 0;} /* Style Definitions */ p.MsoNormal, li.MsoNormal, div.MsoNormal {mso-style-unhide:no; mso-style-qformat:yes; mso-style-parent:""; margin:0in; margin-bottom:.0001pt; mso-pagination:widow-orphan; font-size:12.0pt; font-family:"Times New Roman","serif"; mso-fareast-font-family:"Times New Roman"; mso-fareast-theme-font:minor-fareast;} h4 {mso-style-priority:9; mso-style-unhide:no; mso-style-qformat:yes; mso-style-link:"Heading 4 Char"; mso-margin-top-alt:auto; margin-right:0in; mso-margin-bottom-alt:auto; margin-left:0in; mso-pagination:widow-orphan; mso-outline-level:4; font-size:12.0pt; font-family:"Times New Roman","serif"; mso-fareast-font-family:"Times New Roman"; mso-fareast-theme-font:minor-fareast; font-weight:bold;} h5 {mso-style-priority:9; mso-style-unhide:no; mso-style-qformat:yes; mso-style-link:"Heading 5 Char"; mso-margin-top-alt:auto; margin-right:0in; mso-margin-bottom-alt:auto; margin-left:0in; mso-pagination:widow-orphan; mso-outline-level:5; font-size:10.0pt; font-family:"Times New Roman","serif"; mso-fareast-font-family:"Times New Roman"; mso-fareast-theme-font:minor-fareast; font-weight:bold;} a:link, span.MsoHyperlink {mso-style-noshow:yes; mso-style-priority:99; color:blue; text-decoration:underline; text-underline:single;} a:visited, span.MsoHyperlinkFollowed {mso-style-noshow:yes; mso-style-priority:99; color:blue; text-decoration:underline; text-underline:single;} p {mso-style-noshow:yes; mso-style-priority:99; mso-margin-top-alt:auto; margin-right:0in; mso-margin-bottom-alt:auto; margin-left:0in; mso-pagination:widow-orphan; font-size:12.0pt; font-family:"Times New Roman","serif"; mso-fareast-font-family:"Times New Roman"; mso-fareast-theme-font:minor-fareast;} p.MsoAcetate, li.MsoAcetate, div.MsoAcetate {mso-style-noshow:yes; mso-style-priority:99; mso-style-link:"Balloon Text Char"; margin:0in; margin-bottom:.0001pt; mso-pagination:widow-orphan; font-size:8.0pt; font-family:"Tahoma","sans-serif"; mso-fareast-font-family:"Times New Roman"; mso-fareast-theme-font:minor-fareast;} span.Heading4Char {mso-style-name:"Heading 4 Char"; mso-style-priority:9; mso-style-unhide:no; mso-style-locked:yes; mso-style-link:"Heading 4"; mso-ansi-font-size:12.0pt; mso-bidi-font-size:12.0pt; font-family:"Cambria","serif"; mso-ascii-font-family:Cambria; mso-ascii-theme-font:major-latin; mso-fareast-font-family:"Times New Roman"; mso-fareast-theme-font:major-fareast; mso-hansi-font-family:Cambria; mso-hansi-theme-font:major-latin; mso-bidi-font-family:"Times New Roman"; mso-bidi-theme-font:major-bidi; color:#4F81BD; mso-themecolor:accent1; font-weight:bold; font-style:italic;} span.Heading5Char {mso-style-name:"Heading 5 Char"; mso-style-priority:9; mso-style-unhide:no; mso-style-locked:yes; mso-style-link:"Heading 5"; mso-ansi-font-size:12.0pt; mso-bidi-font-size:12.0pt; font-family:"Cambria","serif"; mso-ascii-font-family:Cambria; mso-ascii-theme-font:major-latin; mso-fareast-font-family:"Times New Roman"; mso-fareast-theme-font:major-fareast; mso-hansi-font-family:Cambria; mso-hansi-theme-font:major-latin; mso-bidi-font-family:"Times New Roman"; mso-bidi-theme-font:major-bidi; color:#243F60; mso-themecolor:accent1; mso-themeshade:127;} span.BalloonTextChar {mso-style-name:"Balloon Text Char"; mso-style-noshow:yes; mso-style-priority:99; mso-style-unhide:no; mso-style-locked:yes; mso-style-link:"Balloon Text"; mso-ansi-font-size:8.0pt; mso-bidi-font-size:8.0pt; font-family:"Tahoma","sans-serif"; mso-ascii-font-family:Tahoma; mso-fareast-font-family:"Times New Roman"; mso-fareast-theme-font:minor-fareast; mso-hansi-font-family:Tahoma; mso-bidi-font-family:Tahoma;} p.sans, li.sans, div.sans {mso-style-name:sans; mso-style-noshow:yes; mso-style-priority:99; mso-style-unhide:no; mso-margin-top-alt:auto; margin-right:0in; mso-margin-bottom-alt:auto; margin-left:0in; mso-pagination:widow-orphan; font-size:9.0pt; font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"; mso-fareast-theme-font:minor-fareast;} p.lsans, li.lsans, div.lsans {mso-style-name:lsans; mso-style-noshow:yes; mso-style-priority:99; mso-style-unhide:no; mso-margin-top-alt:auto; margin-right:0in; mso-margin-bottom-alt:auto; margin-left:0in; mso-pagination:widow-orphan; font-size:12.0pt; font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"; mso-fareast-theme-font:minor-fareast;} span.lsans1 {mso-style-name:lsans1; mso-style-unhide:no; mso-ansi-font-size:12.0pt; mso-bidi-font-size:12.0pt; font-family:"Arial","sans-serif"; mso-ascii-font-family:Arial; mso-hansi-font-family:Arial; mso-bidi-font-family:Arial;} span.sans1 {mso-style-name:sans1; mso-style-unhide:no; mso-ansi-font-size:9.0pt; mso-bidi-font-size:9.0pt; font-family:"Arial","sans-serif"; mso-ascii-font-family:Arial; mso-hansi-font-family:Arial; mso-bidi-font-family:Arial;} span.SpellE {mso-style-name:""; mso-spl-e:yes;} span.GramE {mso-style-name:""; mso-gram-e:yes;} .MsoChpDefault {mso-style-type:export-only; mso-default-props:yes; font-size:10.0pt; mso-ansi-font-size:10.0pt; mso-bidi-font-size:10.0pt;} @page WordSection1 {size:8.5in 11.0in; margin:1.0in 1.0in 1.0in 1.0in; mso-header-margin:.5in; mso-footer-margin:.5in; mso-paper-source:0;} div.WordSection1 {page:WordSection1;} /* List Definitions */ @list l0 {mso-list-id:282349938; mso-list-template-ids:2100749832;} @list l0:level1 {mso-level-tab-stop:.5in; mso-level-number-position:left; text-indent:-.25in;} @list l0:level2 {mso-level-tab-stop:1.0in; mso-level-number-position:left; text-indent:-.25in;} @list l0:level3 {mso-level-tab-stop:1.5in; mso-level-number-position:left; text-indent:-.25in;} @list l0:level4 {mso-level-tab-stop:2.0in; mso-level-number-position:left; text-indent:-.25in;} @list l0:level5 {mso-level-tab-stop:2.5in; mso-level-number-position:left; text-indent:-.25in;} @list l0:level6 {mso-level-tab-stop:3.0in; mso-level-number-position:left; text-indent:-.25in;} @list l0:level7 {mso-level-tab-stop:3.5in; mso-level-number-position:left; text-indent:-.25in;} @list l0:level8 {mso-level-tab-stop:4.0in; mso-level-number-position:left; text-indent:-.25in;} @list l0:level9 {mso-level-tab-stop:4.5in; mso-level-number-position:left; text-indent:-.25in;} @list l1 {mso-list-id:1572039939; mso-list-template-ids:-161598598;} @list l1:level1 {mso-level-tab-stop:.5in; mso-level-number-position:left; text-indent:-.25in;} @list l1:level2 {mso-level-tab-stop:1.0in; mso-level-number-position:left; text-indent:-.25in;} @list l1:level3 {mso-level-tab-stop:1.5in; mso-level-number-position:left; text-indent:-.25in;} @list l1:level4 {mso-level-tab-stop:2.0in; mso-level-number-position:left; text-indent:-.25in;} @list l1:level5 {mso-level-tab-stop:2.5in; mso-level-number-position:left; text-indent:-.25in;} @list l1:level6 {mso-level-tab-stop:3.0in; mso-level-number-position:left; text-indent:-.25in;} @list l1:level7 {mso-level-tab-stop:3.5in; mso-level-number-position:left; text-indent:-.25in;} @list l1:level8 {mso-level-tab-stop:4.0in; mso-level-number-position:left; text-indent:-.25in;} @list l1:level9 {mso-level-tab-stop:4.5in; mso-level-number-position:left; text-indent:-.25in;} ol {margin-bottom:0in;} ul {margin-bottom:0in;} --> </style> <!--[if gte mso 10]> <style> /* Style Definitions */ table.MsoNormalTable {mso-style-name:"Table Normal"; mso-tstyle-rowband-size:0; mso-tstyle-colband-size:0; mso-style-noshow:yes; mso-style-priority:99; mso-style-qformat:yes; mso-style-parent:""; mso-padding-alt:0in 5.4pt 0in 5.4pt; mso-para-margin:0in; mso-para-margin-bottom:.0001pt; mso-pagination:widow-orphan; font-size:10.0pt; font-family:"Times New Roman","serif";} </style> <![endif]--><!--[if gte mso 9]><xml> <o:shapedefaults v:ext="edit" spidmax="5122"/> </xml><![endif]--><!--[if gte mso 9]><xml> <o:shapelayout v:ext="edit"> <o:idmap v:ext="edit" data="1"/> </o:shapelayout></xml><![endif]--> </head> <body bgcolor="#D0D0D0" lang=EN-US link=blue vlink=blue style='tab-interval: .5in' alink=Blue> <div class=WordSection1> <h4><span style='font-family:"Arial","sans-serif";mso-fareast-font-family:"Times New Roman"; mso-no-proof:yes'><img width=16 height=16 id="_x0000_i1044" src="ball_gr.gif"></span><span style='font-family:"Arial","sans-serif";mso-fareast-font-family:"Times New Roman"'>Address <o:p></o:p></span></h4> <table class=MsoNormalTable border=0 cellspacing=0 cellpadding=0 width="100%" style='width:100.0%;mso-cellspacing:0in;mso-yfti-tbllook:1184;mso-padding-alt: 3.75pt 3.75pt 3.75pt 3.75pt'> <col><col> <tr style='mso-yfti-irow:0;mso-yfti-firstrow:yes'> <td style='padding:3.75pt 3.75pt 3.75pt 3.75pt'> <p class=MsoNormal><b><span style='font-size:10.0pt;font-family:"Helvetica","sans-serif"; mso-fareast-font-family:"Times New Roman"'><a href="http://www.business.rutgers.edu/msis" target="_parent">Department of Management Science <br> and Information Systems </a></span></b><span style='mso-fareast-font-family: "Times New Roman"'><o:p></o:p></span></p> </td> <td style='padding:3.75pt 3.75pt 3.75pt 3.75pt'> <p class=MsoNormal><b><span style='font-size:10.0pt;font-family:"Helvetica","sans-serif"; mso-fareast-font-family:"Times New Roman"'><a href="http://rutcor.rutgers.edu" target="_parent">RUTCOR <br> Rutgers Center for Operations Research </a></span></b><span style='mso-fareast-font-family: "Times New Roman"'><o:p></o:p></span></p> </td> </tr> <tr style='mso-yfti-irow:1'> <td style='padding:3.75pt 3.75pt 3.75pt 3.75pt'> <p class=MsoNormal><span style='font-size:10.0pt;font-family:"Helvetica","sans-serif"; mso-fareast-font-family:"Times New Roman"'>251 J.H. Levin Building <br> 94 <span class=SpellE>Rockafeller</span> Road <br> <a href="http://www.kiosk.rutgers.edu/Topology/NewBrunswick.html" target="_parent">Livingston Campus </a></span><span style='mso-fareast-font-family: "Times New Roman"'><o:p></o:p></span></p> </td> <td style='padding:3.75pt 3.75pt 3.75pt 3.75pt'> <p class=MsoNormal><span style='font-size:10.0pt;font-family:"Helvetica","sans-serif"; mso-fareast-font-family:"Times New Roman"'>Room 109 <br> 640 Bartholomew Road <br> <a href="http://www.kiosk.rutgers.edu/Topology/NewBrunswick.html" target="_parent">Busch Campus </a></span><span style='mso-fareast-font-family: "Times New Roman"'><o:p></o:p></span></p> </td> </tr> <tr style='mso-yfti-irow:2'> <td style='padding:3.75pt 3.75pt 3.75pt 3.75pt'> <p class=MsoNormal><span style='font-size:10.0pt;font-family:"Helvetica","sans-serif"; mso-fareast-font-family:"Times New Roman"'><a href="http://www.rutgers.edu" target="_parent">Rutgers University</a> <br> Piscataway, NJ 08854, USA </span><span style='mso-fareast-font-family:"Times New Roman"'><o:p></o:p></span></p> </td> <td style='padding:3.75pt 3.75pt 3.75pt 3.75pt'> <p class=MsoNormal><span style='font-size:10.0pt;font-family:"Helvetica","sans-serif"; mso-fareast-font-family:"Times New Roman"'><a href="http://www.rutgers.edu" target="_parent">Rutgers University</a> <br> Piscataway, NJ 08854, USA </span><span style='mso-fareast-font-family:"Times New Roman"'><o:p></o:p></span></p> </td> </tr> <tr style='mso-yfti-irow:3;mso-yfti-lastrow:yes'> <td style='padding:3.75pt 3.75pt 3.75pt 3.75pt'> <table class=MsoNormalTable border=0 cellpadding=0 style='mso-cellspacing: 1.5pt;mso-yfti-tbllook:1184;mso-padding-alt:0in 5.4pt 0in 5.4pt'> <tr style='mso-yfti-irow:0;mso-yfti-firstrow:yes'> <td style='padding:.75pt .75pt .75pt .75pt'> <p class=MsoNormal><span style='font-size:10.0pt;font-family:"Helvetica","sans-serif"; mso-fareast-font-family:"Times New Roman"'>Phone:</span><span style='mso-fareast-font-family:"Times New Roman"'><o:p></o:p></span></p> </td> <td style='padding:.75pt .75pt .75pt .75pt'> <p class=MsoNormal><span style='font-size:10.0pt;font-family:"Helvetica","sans-serif"; mso-fareast-font-family:"Times New Roman"'>(848) 445-3422 </span><span style='mso-fareast-font-family:"Times New Roman"'><o:p></o:p></span></p> </td> </tr> <tr style='mso-yfti-irow:1'> <td style='padding:.75pt .75pt .75pt .75pt'> <p class=MsoNormal><span style='font-size:10.0pt;font-family:"Helvetica","sans-serif"; mso-fareast-font-family:"Times New Roman"'>Fax: </span><span style='mso-fareast-font-family:"Times New Roman"'><o:p></o:p></span></p> </td> <td style='padding:.75pt .75pt .75pt .75pt'> <p class=MsoNormal><span style='font-size:10.0pt;font-family:"Helvetica","sans-serif"; mso-fareast-font-family:"Times New Roman"'>(848) 445-6329 </span><span style='mso-fareast-font-family:"Times New Roman"'><o:p></o:p></span></p> </td> </tr> <tr style='mso-yfti-irow:2;mso-yfti-lastrow:yes'> <td style='padding:.75pt .75pt .75pt .75pt'> <p class=MsoNormal><span style='font-size:10.0pt;font-family:"Helvetica","sans-serif"; mso-fareast-font-family:"Times New Roman"'>E-mail </span><span style='mso-fareast-font-family:"Times New Roman"'><o:p></o:p></span></p> </td> <td style='padding:.75pt .75pt .75pt .75pt'> <p class=MsoNormal><span style='font-size:10.0pt;font-family:"Helvetica","sans-serif"; mso-fareast-font-family:"Times New Roman"'>login: <span class=SpellE>rusz</span> domain: business.rutgers.edu </span><span style='mso-fareast-font-family: "Times New Roman"'><o:p></o:p></span></p> </td> </tr> </table> </td> <td style='padding:3.75pt 3.75pt 3.75pt 3.75pt'> <table class=MsoNormalTable border=0 cellpadding=0 style='mso-cellspacing: 1.5pt;mso-yfti-tbllook:1184;mso-padding-alt:0in 5.4pt 0in 5.4pt'> <tr style='mso-yfti-irow:0;mso-yfti-firstrow:yes'> <td style='padding:.75pt .75pt .75pt .75pt'> <p class=MsoNormal><span style='font-size:10.0pt;font-family:"Helvetica","sans-serif"; mso-fareast-font-family:"Times New Roman"'>Phone:</span><span style='mso-fareast-font-family:"Times New Roman"'><o:p></o:p></span></p> </td> <td style='padding:.75pt .75pt .75pt .75pt'> <p class=MsoNormal><span style='font-size:10.0pt;font-family:"Helvetica","sans-serif"; mso-fareast-font-family:"Times New Roman"'>(732) 445-3184 </span><span style='mso-fareast-font-family:"Times New Roman"'><o:p></o:p></span></p> </td> </tr> <tr style='mso-yfti-irow:1'> <td style='padding:.75pt .75pt .75pt .75pt'> <p class=MsoNormal><span style='font-size:10.0pt;font-family:"Helvetica","sans-serif"; mso-fareast-font-family:"Times New Roman"'>Fax: </span><span style='mso-fareast-font-family:"Times New Roman"'><o:p></o:p></span></p> </td> <td style='padding:.75pt .75pt .75pt .75pt'> <p class=MsoNormal><span style='font-size:10.0pt;font-family:"Helvetica","sans-serif"; mso-fareast-font-family:"Times New Roman"'>(732) 445-5472 </span><span style='mso-fareast-font-family:"Times New Roman"'><o:p></o:p></span></p> </td> </tr> <tr style='mso-yfti-irow:2;mso-yfti-lastrow:yes'> <td style='padding:.75pt .75pt .75pt .75pt'> <p class=MsoNormal><span style='font-size:10.0pt;font-family:"Helvetica","sans-serif"; mso-fareast-font-family:"Times New Roman"'>E-mail: </span><span style='mso-fareast-font-family:"Times New Roman"'><o:p></o:p></span></p> </td> <td style='padding:.75pt .75pt .75pt .75pt'> <p class=MsoNormal><span style='font-size:10.0pt;font-family:"Helvetica","sans-serif"; mso-fareast-font-family:"Times New Roman"'>login: <span class=SpellE>rusz</span> domain: business.rutgers.edu </span><span style='mso-fareast-font-family: "Times New Roman"'><o:p></o:p></span></p> </td> </tr> </table> </td> </tr> </table> <div class=MsoNormal align=center style='text-align:center'><span style='font-size:10.0pt;font-family:"Helvetica","sans-serif";mso-fareast-font-family: "Times New Roman"'> <hr size=2 width="100%" align=center> </span></div> <h4><span style='font-family:"Arial","sans-serif";mso-fareast-font-family:"Times New Roman"; mso-no-proof:yes'><img border=0 width=16 height=16 id="_x0000_i1043" src="ball_gr.gif"></span><a href="http://personal.stevens.edu/~ddentche/poster2011.pdf" target="_parent"><span style='font-family:"Arial","sans-serif";mso-fareast-font-family:"Times New Roman"'>6th Rutgers-Stevens Workshop on Optimization of Stochastic Systems (November 4--5, 2011) </span></a><span style='font-family:"Arial","sans-serif";mso-fareast-font-family: "Times New Roman"'><o:p></o:p></span></h4> <h4 align=center style='text-align:center'><a name=workshop><span style='font-size:10.0pt;font-family:"Helvetica","sans-serif";mso-fareast-font-family: "Times New Roman"'> <hr size=2 width="100%" align=center> </span></a></h4> <h4><span style='mso-bookmark:workshop'></span><span style='mso-bookmark:workshop'><span style='font-family:"Arial","sans-serif";mso-fareast-font-family:"Times New Roman"; mso-no-proof:yes'><img border=0 width=16 height=16 id="_x0000_i1042" src="ball_gr.gif"></span></span><a href="http://www.rusz.rutgers.edu/5th_workshop_page.htm" target="_parent"><span style='mso-bookmark:workshop'><span style='font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>5th Rutgers-Stevens Workshop on Optimization of Stochastic Systems (March 20--21, 2009) </span></span><span style='mso-bookmark:workshop'></span></a><span style='mso-bookmark:workshop'><span style='font-family:"Arial","sans-serif";mso-fareast-font-family:"Times New Roman"'><o:p></o:p></span></span></h4> <div class=MsoNormal align=center style='text-align:center'><span style='mso-bookmark:workshop'><span class=lsans1><span style='mso-fareast-font-family: "Times New Roman"'> <hr size=2 width="100%" align=center> </span></span></span></div> <span style='mso-bookmark:workshop'></span> <h4><span style='font-family:"Arial","sans-serif";mso-fareast-font-family:"Times New Roman"; mso-no-proof:yes'><img border=0 width=16 height=16 id="_x0000_i1041" src="ball_gr.gif"></span><span style='font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'><a href="http://personal.stevens.edu/~ddentche/symp07/poster07p.htm" target="_parent">4th Rutgers-Stevens Workshop on Optimization of Stochastic Systems (March 30--31, 2007) </a></span></h4> <div class=MsoNormal align=center style='text-align:center'><span class=lsans1><span style='mso-fareast-font-family:"Times New Roman"'> <hr size=2 width="100%" align=center> </span></span></div> <h4><a name=interests></a><span style='font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman";mso-no-proof:yes'><img border=0 width=16 height=16 id="_x0000_i1040" src="ball_gr.gif"></span><span style='font-family:"Arial","sans-serif";mso-fareast-font-family:"Times New Roman"'>Research Interests and Service </span></h4> <p class=MsoNormal><span class=sans1><b><span style='font-size:9.0pt; mso-fareast-font-family:"Times New Roman"'>Interests:</span></b></span><span class=sans1><span style='font-size:9.0pt;mso-fareast-font-family:"Times New Roman"'> Optimization - Risk - Business Analytics </span></span><span style='font-size: 9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family:"Times New Roman"'><br> <span class=sans1><b>Service:</b> Associate Editor, <a href="http://www.siam.org/journals/siopt/siopt.htm" target="_parent"><em><span style='font-family:"Arial","sans-serif"'>SIAM Journal on Optimization</span></em></a>, </span><em><u><span style='font-family:"Arial","sans-serif";color:blue'>Mathematics of Operations Research</span></u></em><span class=sans1>, <a href="http://www.tandf.co.uk/journals/titles/10556788.html" target="_parent"><em><span style='font-family:"Arial","sans-serif"'>Optimization Methods and <span class=GramE>Software </span></span></em></a>, <a href="http://www.springer.com/business/operations+research/journal/10479" target="_parent"><em><span style='font-family:"Arial","sans-serif"'>Annals of Operations Research </span></em></a></span></span><span class=sans1><span style='font-size:9.0pt'><span style='mso-spacerun:yes'> </span><o:p></o:p></span></span></p> <div class=MsoNormal align=center style='text-align:center'><span class=sans1><span style='font-size:9.0pt;mso-fareast-font-family:"Times New Roman"'> <hr size=2 width="100%" align=center> </span></span></div> <h4><a name=employment></a><span style='font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman";mso-no-proof:yes'><img border=0 width=16 height=16 id="_x0000_i1039" src="ball_gr.gif"></span><span style='font-family:"Arial","sans-serif";mso-fareast-font-family:"Times New Roman"'>Employment History </span></h4> <table class=MsoNormalTable border=0 cellpadding=0 style='mso-cellspacing:1.5pt; mso-yfti-tbllook:1184;mso-padding-alt:0in 5.4pt 0in 5.4pt'> <tr style='mso-yfti-irow:0;mso-yfti-firstrow:yes'> <td style='padding:.75pt .75pt .75pt .75pt'> <p class=MsoNormal><span style='font-size:10.0pt;font-family:"Helvetica","sans-serif"; mso-fareast-font-family:"Times New Roman"'>1974--91 </span><span style='mso-fareast-font-family:"Times New Roman"'><o:p></o:p></span></p> </td> <td style='padding:.75pt .75pt .75pt .75pt'> <p class=MsoNormal><span style='font-size:10.0pt;font-family:"Helvetica","sans-serif"; mso-fareast-font-family:"Times New Roman"'><a href="http://www.elka.pw.edu.pl/index.php?lang=en" target="_parent">Department of Electronics and Information Technology </a>, <a href="http://eng.pw.edu.pl/" target="_parent">Warsaw University of Technology </a>, Poland </span><span style='mso-fareast-font-family:"Times New Roman"'><o:p></o:p></span></p> </td> </tr> <tr style='mso-yfti-irow:1'> <td style='padding:.75pt .75pt .75pt .75pt'> <p class=MsoNormal><span style='font-size:10.0pt;font-family:"Helvetica","sans-serif"; mso-fareast-font-family:"Times New Roman"'>1984--86 </span><span style='mso-fareast-font-family:"Times New Roman"'><o:p></o:p></span></p> </td> <td style='padding:.75pt .75pt .75pt .75pt'> <p class=MsoNormal><span style='font-size:10.0pt;font-family:"Helvetica","sans-serif"; mso-fareast-font-family:"Times New Roman"'><a href="http://www.unizh.ch/ior" target="_parent">Institute of Operations Research, </a><a href="http://www.unizh.ch/" target="_parent">University of Zurich </a>, Switzerland </span><span style='mso-fareast-font-family:"Times New Roman"'><o:p></o:p></span></p> </td> </tr> <tr style='mso-yfti-irow:2'> <td style='padding:.75pt .75pt .75pt .75pt'> <p class=MsoNormal><span style='font-size:10.0pt;font-family:"Helvetica","sans-serif"; mso-fareast-font-family:"Times New Roman"'>1991--92 </span><span style='mso-fareast-font-family:"Times New Roman"'><o:p></o:p></span></p> </td> <td style='padding:.75pt .75pt .75pt .75pt'> <p class=MsoNormal><span style='font-size:10.0pt;font-family:"Helvetica","sans-serif"; mso-fareast-font-family:"Times New Roman"'><a href="http://www.orfe.princeton.edu" target="_parent">Department of Civil Engineering and Operations Research, Princeton University </a>, USA </span><span style='mso-fareast-font-family:"Times New Roman"'><o:p></o:p></span></p> </td> </tr> <tr style='mso-yfti-irow:3'> <td style='padding:.75pt .75pt .75pt .75pt'> <p class=MsoNormal><span style='font-size:10.0pt;font-family:"Helvetica","sans-serif"; mso-fareast-font-family:"Times New Roman"'>1992--96 </span><span style='mso-fareast-font-family:"Times New Roman"'><o:p></o:p></span></p> </td> <td style='padding:.75pt .75pt .75pt .75pt'> <p class=MsoNormal><span style='font-size:10.0pt;font-family:"Helvetica","sans-serif"; mso-fareast-font-family:"Times New Roman"'><a href="http://www.iiasa.ac.at/" target="_parent">International Institute for Applied Systems Analysis, </a><span class=SpellE>Laxenburg</span>, Austria </span><span style='mso-fareast-font-family: "Times New Roman"'><o:p></o:p></span></p> </td> </tr> <tr style='mso-yfti-irow:4'> <td style='padding:.75pt .75pt .75pt .75pt'> <p class=MsoNormal><span style='font-size:10.0pt;font-family:"Helvetica","sans-serif"; mso-fareast-font-family:"Times New Roman"'>1996--97 </span><span style='mso-fareast-font-family:"Times New Roman"'><o:p></o:p></span></p> </td> <td style='padding:.75pt .75pt .75pt .75pt'> <p class=MsoNormal><span style='font-size:10.0pt;font-family:"Helvetica","sans-serif"; mso-fareast-font-family:"Times New Roman"'><a href="http://www.engr.wisc.edu/ie/" target="_parent">Department of Industrial Engineering, University of Wisconsin-Madison, </a>USA </span><span style='mso-fareast-font-family:"Times New Roman"'><o:p></o:p></span></p> </td> </tr> <tr style='mso-yfti-irow:5;mso-yfti-lastrow:yes'> <td style='padding:.75pt .75pt .75pt .75pt'> <p class=MsoNormal><span style='font-size:10.0pt;font-family:"Helvetica","sans-serif"; mso-fareast-font-family:"Times New Roman"'>1997-- </span><span style='mso-fareast-font-family:"Times New Roman"'><o:p></o:p></span></p> </td> <td style='padding:.75pt .75pt .75pt .75pt'> <p class=MsoNormal><span style='font-size:10.0pt;font-family:"Helvetica","sans-serif"; mso-fareast-font-family:"Times New Roman"'><a href="http://msis.rutgers.edu" target="_parent">Department of Management Science and Information Systems, Rutgers University, </a>USA </span><span style='mso-fareast-font-family:"Times New Roman"'><o:p></o:p></span></p> </td> </tr> </table> <div class=MsoNormal align=center style='text-align:center'><span class=sans1><span style='font-size:9.0pt;mso-fareast-font-family:"Times New Roman"'> <hr size=2 width="100%" align=center> </span></span></div> <h4><a name=books></a><span style='font-family:"Arial","sans-serif";mso-fareast-font-family: "Times New Roman";mso-no-proof:yes'><img border=0 width=16 height=16 id="_x0000_i1038" src="ball_gr.gif"></span><span style='font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>Books </span></h4> <table class=MsoNormalTable border=0 cellpadding=0 style='mso-cellspacing:1.5pt; mso-yfti-tbllook:1184;mso-padding-alt:0in 5.4pt 0in 5.4pt'> <tr style='mso-yfti-irow:0;mso-yfti-firstrow:yes'> <td style='padding:.75pt .75pt .75pt .75pt'> <p class=MsoNormal align=center style='text-align:center'><span style='mso-fareast-font-family:"Times New Roman";mso-no-proof:yes'><img border=0 width=200 height=275 id="_x0000_i1037" src="SIAM_cover.bmp"></span><span style='mso-fareast-font-family:"Times New Roman"'><o:p></o:p></span></p> </td> <td style='padding:.75pt .75pt .75pt .75pt'> <h4><em><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.ec-securehost.com/SIAM/MP09.html" target="_parent">Lectures on Stochastic Programming: Modeling and Theory </a></span></em><span style='mso-fareast-font-family:"Times New Roman"'><o:p></o:p></span></h4> <h4><span style='mso-fareast-font-family:"Times New Roman"'>Alexander Shapiro, Darinka Dentcheva and Andrzej <span class=SpellE>RuszczyDski</span> <o:p></o:p></span></h4> <h4><span style='mso-fareast-font-family:"Times New Roman"'>SIAM, Philadelphia, 2009 <o:p></o:p></span></h4> </td> </tr> <tr style='mso-yfti-irow:1'> <td style='padding:.75pt .75pt .75pt .75pt'> <p class=MsoNormal align=center style='text-align:center'><span style='mso-fareast-font-family:"Times New Roman";mso-no-proof:yes'><img border=0 width=200 height=275 id="_x0000_i1036" src="NLP_cover.gif"></span><span style='mso-fareast-font-family:"Times New Roman"'><o:p></o:p></span></p> </td> <td style='padding:.75pt .75pt .75pt .75pt'> <h4><em><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.pupress.princeton.edu/titles/8219.html" target="_parent">Nonlinear Optimization </a></span></em><span style='mso-fareast-font-family:"Times New Roman"'><o:p></o:p></span></h4> <h4><span style='mso-fareast-font-family:"Times New Roman"'>Andrzej <span class=SpellE>RuszczyDski</span> <o:p></o:p></span></h4> <h4><span style='mso-fareast-font-family:"Times New Roman"'>Princeton University Press, Princeton 2006 <o:p></o:p></span></h4> <h5><em><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.pupress.princeton.edu/titles/8219.html" target="_parent">PUP Catalog Entry </a></span></em><span style='mso-fareast-font-family:"Times New Roman"'><br> <em><a href="NLP_TOC.htm" target="_parent">Table of Contents </a></em><br> <em><a href="http://www.pupress.princeton.edu/chapters/s8219.pdf" target="_parent">Chapter 1 </a></em><br> <br> Reviews: <br> <em><a href="Reviews/Zbl-1108.htm" target="_parent"><span class=SpellE>Zentralblatt</span> MATH </a></em><br> <em><a href="Reviews/ORl-Review-Web.htm" target="_parent">Operations Research Letters </a></em><br> <em><a href="Reviews/MMOR-review.pdf" target="_parent">Mathematical Methods of Operations Research </a></em><br> <br> <em><a href="Reviews/NLP_book_errata.pdf" target="_parent">Errata </a></em><o:p></o:p></span></h5> </td> </tr> <tr style='mso-yfti-irow:2;mso-yfti-lastrow:yes'> <td style='padding:.75pt .75pt .75pt .75pt'> <p class=MsoNormal align=center style='text-align:center'><span style='mso-fareast-font-family:"Times New Roman";mso-no-proof:yes'><img border=0 width=200 height=275 id="_x0000_i1035" src="handbook_cover.jpg"></span><span style='mso-fareast-font-family:"Times New Roman"'><o:p></o:p></span></p> </td> <td style='padding:.75pt .75pt .75pt .75pt'> <h4><span style='mso-fareast-font-family:"Times New Roman"'><a href="http://www.elsevier.com/wps/find/S03.cws_home/stochasticprogramming" target="_parent"><em>Stochastic Programming, Handbook in Operations Research and Management Science </em></a><o:p></o:p></span></h4> <h4><span style='mso-fareast-font-family:"Times New Roman"'>A. <span class=SpellE>RuszczyDski</span> and A. Shapiro (Editors) <o:p></o:p></span></h4> <h4><span style='mso-fareast-font-family:"Times New Roman"'>Elsevier Science, Amsterdam, 2003 <o:p></o:p></span></h4> </td> </tr> </table> <h4><a name=pubs1></a><span style='font-family:"Arial","sans-serif";mso-fareast-font-family: "Times New Roman";mso-no-proof:yes'><img border=0 width=16 height=16 id="_x0000_i1034" src="ball_gr.gif"></span><span style='font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>Refereed Journal Publications </span><span style='mso-fareast-font-family:"Times New Roman"'><o:p></o:p></span></h4> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>1.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp;&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>A. Lizyayev, A. <span class=SpellE>RuszczyDski</span>, <a href="http://dx.doi.org/10.1016/j.ejor.2011.11.019" target="_parent">Tractable Almost Stochastic Dominance </a>, <em><span style='font-family:"Arial","sans-serif"'>European Journal of Operational Research, </span></em>to appear. (<a href="http://dx.doi.org/10.1016/j.ejor.2011.11.019" target="_parent"> DOI: 10.1016/j.ejor.2011.11.019 </a>) <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>2.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp;&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>S. Choi, A. <span class=SpellE>RuszczyDski</span>, Y. Zhao, <a href="http://dx.doi.org/10.1287/opre.1100.0896" target="_parent">A Multi-Product Risk-Averse Newsvendor with Law Invariant Coherent Measures of <span class=GramE>Risk </span></a>, <em><span style='font-family:"Arial","sans-serif"'>Operations Research </span></em>59 (2011), No. 2, 346--364. (<a href="http://dx.doi.org/10.1287/opre.1100.0896" target="_parent"> DOI: 10.1287/opre.1100.0896 </a>) <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>3.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp;&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>S. Choi, A. <span class=SpellE>RuszczyDski</span>, <a href="http://dx.doi.org/10.1016/j.ejor.2011.04.005" target="_parent">A Multi-Product Risk-Averse Newsvendor with Exponential Utility <span class=GramE>Function </span></a>, <em><span style='font-family:"Arial","sans-serif"'>European Journal of Operational Research </span></em>214 (2011), No. 1, 78--84. (<a href="http://dx.doi.org/10.1016/j.ejor.2011.04.005" target="_parent"> DOI: 10.1016/j.ejor.2011.04.005 </a>) <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>4.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp;&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>N. Miller, A. <span class=SpellE>RuszczyDski</span>, <a href="http://dx.doi.org/10.1287/opre.1100.0847" target="_parent">Risk-Averse Two-Stage Stochastic Linear Programming: Modeling and <span class=GramE>Decomposition </span></a>, <em><span style='font-family:"Arial","sans-serif"'>Operations Research </span></em>59 (2011) 125-132. (<a href="http://dx.doi.org/10.1287/opre.1100.0847" target="_parent"> DOI: 10.1287/opre.1100.0847 </a>) <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>5.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp;&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>A. <span class=SpellE>RuszczyDski</span>, <a href="http://dx.doi.org/10.1007/s10107-010-0393-3" target="_parent">Risk-averse dynamic programming for Markov decision <span class=GramE>processes </span></a>, <em><span style='font-family:"Arial","sans-serif"'>Mathematical Programming, Series B</span></em> 125 (2010) 235--261, (<a href="http://dx.doi.org/10.1007/s10107-010-0393-3" target="_parent"> DOI: 10.1007/s10107-010-0393-3 </a>.) <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>6.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp;&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>D. Dentcheva, S. Penev, A. <span class=SpellE>RuszczyDski</span>, <a href="http://dx.doi.org/10.1007/s10479-010-0747-5" target="_parent"><span class=SpellE>Kusuoka</span> representation of higher order dual risk measures </a>, <em><span style='font-family:"Arial","sans-serif"'>Annals of Operations Research</span></em> 181 (2010) 325--335. (<a href="http://dx.doi.org/10.1007/s10479-010-0747-5" target="_parent"> DOI: 10.1007/s10479-010-0747-<span class=GramE>5 </span></a>.) <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>7.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp;&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>D. Dentcheva, A. <span class=SpellE>RuszczyDski</span>, <a href="http://dx.doi.org/10.1080/02331931003696350" target="_parent">Inverse cutting plane methods for optimization problems with second-order stochastic dominance <span class=GramE>constraints </span></a>, <em><span style='font-family:"Arial","sans-serif"'>Optimization</span></em> 59 (2010) 323--338. (<a href="http://dx.doi.org/10.1080/02331931003696350" target="_parent"> DOI: 10.1080/<span class=GramE>02331931003696350 </span></a>.) <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>8.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp;&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>D. Dentcheva, A. <span class=SpellE>RuszczyDski</span>, <a href="http://dx.doi.org/10.1007/s10107-009-0321-6" target="_parent">Robust stochastic dominance and its application to risk-averse <span class=GramE>optimization </span></a>, <em><span style='font-family:"Arial","sans-serif"'>Mathematical Programming, Series B</span></em>, 123 (2010) 85--100. (<a href="http://dx.doi.org/10.1007/s10107-009-0321-6" target="_parent"> DOI: 10.1007/s10107-009-0321-<span class=GramE>6 </span></a>.) <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>9.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp;&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>D. Dentcheva, A. <span class=SpellE>RuszczyDski</span>, <a href="http://www.springerlink.com/content/834v6268r09575w9/" target="_parent">Optimization with multivariate stochastic dominance <span class=GramE>constraints </span></a>, <em><span style='font-family:"Arial","sans-serif"'>Mathematical Programming</span></em> 117 (2009) 111-127 (<a href="http://dx.doi.org/10.1007/s10107-007-0165-x" target="_parent"> DOI: 10.1007/s10107-007-0165-x </a>.) <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>10.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>G. Rudolf and A. <span class=SpellE>RuszczyDski</span>, <a href="http://dx.doi.org/10.1137/070702473" target="_parent">Optimization problems with second order stochastic dominance constraints: duality, compact formulations, and cut generation <span class=GramE>methods </span></a>, <em><span style='font-family:"Arial","sans-serif"'>SIAM J. on Optimization </span></em>19 (2008), No. 3, 1326--1343. (doi:10.1137/070702473) <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>11.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>D. Dentcheva and A. <span class=SpellE>RuszczyDski</span>, <a href="http://www.ybook.co.jp/online/pjoe/vol4/p447.html" target="_parent">Duality between coherent risk measures and stochastic dominance constraints in risk-averse <span class=GramE>optimization </span></a>, <em><span style='font-family:"Arial","sans-serif"'>Pacific J. of Optimization </span></em>, vol. 4 (2008), No. 3, 433-446. <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>12.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>D. Dentcheva and A. <span class=SpellE>RuszczyDski</span>, <a href="http://dx.doi.org/10.1137/070679569" target="_parent">Stochastic dynamic optimization with discounted stochastic dominance <span class=GramE>constraints </span></a>, <em><span style='font-family:"Arial","sans-serif"'>SIAM J. on Control and Optimization </span></em>47 (2008), No. 5, 2540--2556. (doi:10.1137/070679569) <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>13.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>S.D. Flam and A. <span class=SpellE>RuszczyDski</span>, Finding normalized equilibrium in convex-concave games, <em><span style='font-family:"Arial","sans-serif"'>Int. Game Theory Rev. </span></em>10 (2008), no. 1, 37--51. <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>14.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>A. <span class=SpellE>RuszczyDski</span>, <a href="http://dx.doi.org/10.1080/10556780701318796" target="_parent">A merit function approach to the <span class=SpellE>subgradient</span> method with <span class=GramE>averaging </span></a>, <em><span style='font-family:"Arial","sans-serif"'>Optimization Methods and Software </span></em>23 (2008), No. 1, 161--172. (doi:10.1080/10556780701318796) <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>15.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>D. Dentcheva, A. <span class=SpellE>RuszczyDski</span>, <a href="CRABS-dynamic.pdf" target="_parent">Stochastic dominance for sequences and implied utility in dynamic optimization </a>, <em><span style='font-family: "Arial","sans-serif"'>C. R. Acad. <span class=SpellE>Bulgare</span> Sci. </span></em>57 (2008), No. 1, 15--22. <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>16.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>N. Miller, A. <span class=SpellE>RuszczyDski</span>, <a href="http://dx.doi.org/10.1016/j.ejor.2007.06.052" target="_parent">Risk-adjusted probability measures in portfolio optimization with coherent measures of <span class=GramE>risk </span></a>, <em><span style='font-family:"Arial","sans-serif"'>European Journal of Operational Research </span></em>191 (2008), No. 1, 193--206. (doi:10.1016/j.ejor.2007.06.052) <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>17.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>S. Choi, A. <span class=SpellE>RuszczyDski</span>, <a href="http://dx.doi.org/10.1016/j.orl.2007.04.008" target="_parent">A risk-averse newsvendor with law invariant coherent measures of <span class=GramE>risk </span></a>, <em><span style='font-family:"Arial","sans-serif"'>Operations Research Letters </span></em>36 (2008), No. 1, 77--82. (doi:10.1016/j.orl.2007.04.008) <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>18.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>D. Dentcheva, A. <span class=SpellE>RuszczyDski</span>, <a href="ControlCybernetics2007.pdf" target="_parent">Composite semi-infinite <span class=GramE>optimization </span></a>, <em><span style='font-family:"Arial","sans-serif"'>Control and Cybernetics</span></em> 36 (2007) 633--646. <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>19.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>D. Dentcheva, R. <span class=SpellE>Henrion</span> and A. <span class=SpellE>RuszczyDski</span>, <a href="http://dx.doi.org/10.1137/060650118" target="_parent">Stability and sensitivity of optimization problems with first order stochastic dominance constraints </a>, <em><span style='font-family:"Arial","sans-serif"'>SIAM Journal on Optimization </span></em>18 (2007) 322--333. (DOI: 10.1137/060650118) <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>20.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>N. Noyan, A. <span class=SpellE>RuszczyDski</span>, <a href="http://www.springerlink.com/content/qm626r63621126rt/" target="_parent">Valid inequalities and restrictions for stochastic programming problems with first order stochastic dominance constraints</a>, <em><span style='font-family:"Arial","sans-serif"'>Mathematical Programming</span></em> 115 (2008) 249--275 ( <a href="http://dx.doi.org/10.1007/s10107-007-0100-1" target="_parent">DOI: 10.1007/s10107-007-0100-1 </a>) <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>21.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>M. Lejeune, A. <span class=SpellE>RuszczyDski</span>, <a href="Lejeune-RuszczyDski-OR2007.pdf" target="_parent">An efficient trajectory method for probabilistic production-inventory-distribution problems</a>, <em><span style='font-family:"Arial","sans-serif"'>Operations Research</span></em> 55 (2007) 378--394. <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>22.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>A. <span class=SpellE>RuszczyDski</span>, A. Shapiro, <a href="1526-5471-2006-31-03-0433.pdf" target="_parent">Optimization of Convex Risk <span class=GramE>Functions </span></a>, <em><span style='font-family:"Arial","sans-serif"'>Mathematics of Operations Research </span></em>31 (2006) 433--452. <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>23.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>A. <span class=SpellE>RuszczyDski</span>, A. Shapiro, <a href="1526-5471-2006-31-03-0544.pdf" target="_parent">Conditional Risk <span class=GramE>Mappings </span></a>, <em><span style='font-family:"Arial","sans-serif"'>Mathematics of Operations Research </span></em>31 (2006) 544--561. <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>24.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>L. Lei, S.G. Liu, A. <span class=SpellE>RuszczyDski</span> and S. Park, On the integrated production, inventory, and distribution routing problem, IIE Transactions 38 (2006) 955--970 <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>25.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>D. Dentcheva, A. <span class=SpellE>RuszczyDski</span>,<a href="http://www.springerlink.com/content/rk231618211t4gu8/?p=6f5a7d1b4a7741259a6c6eb3fc3792ea&amp;pi=3"> Inverse stochastic dominance constraints and rank dependent expected utility theory</a>, <em><span style='font-family:"Arial","sans-serif"'>Mathematical Programming </span></em>108 (2006) 297--311, (<a href="http://dx.doi.org/10.1007/s10107-006-0712-x" target="_parent"> DOI 10.1007/s10107-006-0712-x </a>) <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>26.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>N. Noyan, G. Rudolf and A. <span class=SpellE>RuszczyDski</span>, Relaxations of Linear Programming Problems with First Order Stochastic Dominance Constraints, <em><span style='font-family: "Arial","sans-serif"'>Operations Research Letters</span></em> 34 (2006) 653--659 (<a href="http://dx.doi.org/10.1016/j.orl.2005.10.004" target="_parent"> doi:10.1016/j.orl.2005.10.004 </a>) <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>27.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>D. Dentcheva, A. <span class=SpellE>RuszczyDski</span>, <a href="http://dx.doi.org/10.1016/j.jbankfin.2005.04.024" target="_parent">Portfolio Optimization with Stochastic Dominance Constraints,</a> <em><span style='font-family:"Arial","sans-serif"'>Journal of Banking and Finance </span></em>30/2 (2006) 433--451 (doi:10.1016/j.jbankfin.2005.04.024) <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>28.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>D. Dentcheva, A. <span class=SpellE>RuszczyDski</span>, <a href="http://taylorandfrancis.metapress.com/link.asp?id=xn8l95e1w00du2d2" target="_parent">Semi-Infinite Probabilistic Optimization: First Order Stochastic Dominance <span class=GramE>Constraints </span></a>, <em><span style='font-family:"Arial","sans-serif"'>Optimization </span></em>53 (2004) 583--601. (<a href="http://dx.doi.org/10.1080/02331930412331327148" target="_parent"> DOI: 10.1080/02331930412331327148 </a>) <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>29.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>D. Dentcheva, A. <span class=SpellE>RuszczyDski</span>, <a href="http://ideas.repec.org/p/wpa/wuwpge/0402005.html" target="_parent"><span class=SpellE>Convexification</span> of Stochastic Ordering, </a><em><span style='font-family:"Arial","sans-serif"'>C. R. Acad. <span class=SpellE>Bulgare</span> Sci. </span></em>57 (2004), No. 3, 5--10. <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>30.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>D. Dentcheva, B. Lai and A. <span class=SpellE>RuszczyDski</span>, <a href="http://www.springerlink.com/index/10.1007/s001860400371" target="_parent">Dual Methods for Probabilistic Optimization Problems, </a><em><span style='font-family:"Arial","sans-serif"'>Mathematical Methods of Operations Research (ZOR) </span></em>60 (2004), No. 2, 331--346. <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>31.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>W. Powell, A. <span class=SpellE>RuszczyDski</span>, H. Topaloglu, <a href="MOR_2004.pdf" target="_parent">Learning algorithms for separable approximations of stochastic optimization problems, </a><em><span style='font-family:"Arial","sans-serif"'>Mathematics of Operations Research </span></em>29 (2004) 814--836. <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>32.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>D. Dentcheva and A. <span class=SpellE>RuszczyDski</span>, <a href="%0d%0ahttp:/www.springerlink.com/content/dcxatarqvabtnfpk/?p=6f5a7d1b4a7741259a6c6eb3fc3792ea&amp;pi=5" target="_parent">Optimality and Duality Theory for Stochastic Optimization Problems with Nonlinear Dominance Constraints, </a><em><span style='font-family: "Arial","sans-serif"'>Mathematical Programming </span></em>99 (2004) 329--350. (<a href="http://dx.doi.org/10.1007/s10107-003-0453-z" target="_parent"> DOI:10.1007/s10107-003-0453-z</a>) <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>33.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>D. Dentcheva and A. <span class=SpellE>RuszczyDski</span>, <a href="http://dx.doi.org/10.1137/S1052623402420528" target="_parent">Optimization with Stochastic Dominance <span class=GramE>Constraints </span></a>, <em><span style='font-family:"Arial","sans-serif"'>SIAM Journal on Optimization </span></em>14 (2003) 548--566. (<a href="http://dx.doi.org/10.1137/S1052623402420528" target="_parent"> doi:10.1137/S1052623402420528 </a>) <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>34.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>A. <span class=SpellE>RuszczyDski</span> and R. Vanderbei, <a href="http://dx.doi.org/10.1111/1468-0262.00448" target="_parent">Frontiers of Stochastically <span class=SpellE>Nondominated</span> Portfolios </a>, <span class=SpellE><em><span style='font-family:"Arial","sans-serif"'>Econometrica</span></em></span><em><span style='font-family:"Arial","sans-serif"'> </span></em>71 (2003) 1287-1297 <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>35.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>A. <span class=SpellE>RuszczyDski</span>, <a href="http://dx.doi.org/10.1007/s10107-002-0337-7" target="_parent">Probabilistic programming with discrete distributions and precedence constrained knapsack <span class=SpellE>polyhedra</span>, </a><em><span style='font-family:"Arial","sans-serif"'>Mathematical Programming </span></em>93 (2002) 195--215. <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>36.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>P. <span class=SpellE>Beraldi</span> and A. <span class=SpellE>RuszczyDski</span>, <a href="http://dx.doi.org/10.1287/opre.50.6.956.345" target="_parent">The probabilistic set covering problem, </a><em><span style='font-family:"Arial","sans-serif"'>Operations Research </span></em>50 (2002) 956--967. <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>37.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>D. Dentcheva, A. Prekopa and A. <span class=SpellE>RuszczyDski</span>, Bounds for probabilistic integer programming problems, <em><span style='font-family:"Arial","sans-serif"'>Discrete Applied Mathematics </span></em>124 (2002) 55-65. <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>38.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>P. <span class=SpellE>Beraldi</span> and A. <span class=SpellE>RuszczyDski</span>, A branch and bound method for stochastic integer problems under probabilistic constraints, <em><span style='font-family:"Arial","sans-serif"'>Optimization Methods and Software </span></em>17 (2002) 359--382. <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>39.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>W. Ogryczak and A. <span class=SpellE>RuszczyDski</span>, <a href="http://dx.doi.org/10.1137/S1052623400375075" target="_parent">Dual stochastic dominance and related mean--risk models, </a><em><span style='font-family:"Arial","sans-serif"'>SIAM Journal on Optimization </span></em>13 (2002) 60--78. (DOI: 10.1137/S1052623400375075) <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>40.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>A. <span class=SpellE>Kryazhimskii</span> and A. <span class=SpellE>RuszczyDski</span>, <a href="http://pubsonline.informs.org/main/pdfstore/aba7c5a110_abstract.pdf" target=parent>Constraint aggregation in infinite-dimensional spaces and applications, </a><em><span style='font-family:"Arial","sans-serif"'>Mathematics of Operations Research </span></em>26 (2001) 769--795. <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>41.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>H. Konno, J. M. <span class=SpellE>Mulvey</span> and A. <span class=SpellE>RuszczyDski</span> (Eds.), <em><span style='font-family:"Arial","sans-serif"'>Mathematical Programming and <span class=GramE>Finance <span style='font-style:normal'>.</span></span></span></em> <em><span style='font-family:"Arial","sans-serif"'>Mathematical <span class=SpellE>Programing</span> </span></em>89 (2001), Ser. B. Springer-<span class=SpellE>Verlag</span>, Heidelberg. <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>42.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>D. Dentcheva, A. Prekopa and A. <span class=SpellE>RuszczyDski</span>, <span class=GramE>On</span> convex probabilistic programming with discrete distributions, <em><span style='font-family:"Arial","sans-serif"'>Nonlinear Analysis </span></em>47 (3) (2001) 1997-2009. <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>43.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>W. Ogryczak and A. <span class=SpellE>RuszczyDski</span>, <a href="http://www.springerlink.com/content/8tughcvmq50tv7f5/?p=6f5a7d1b4a7741259a6c6eb3fc3792ea&amp;pi=4" target="_parent"><span class=GramE>On</span> consistency of stochastic dominance and mean--<span class=SpellE>semideviation</span> models,</a> <em><span style='font-family:"Arial","sans-serif"'>Mathematical Programming </span></em>89 (2001) 217--232. (<a href="http://dx.doi.org/10.1007/PL00011396" target="_parent"> DOI 10.1007/PL00011396 </a>) <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>44.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>D. Dentcheva, A. Prekopa and A. <span class=SpellE>RuszczyDski</span>, <a href="http://www.springerlink.com/content/k9yknvjxdkc9pnlx/?p=e1cd3d58b36f459a9c27cfeacf16da3e&amp;pi=1" target="_parent">Concavity and efficient points of discrete distributions in probabilistic programming,</a> <em><span style='font-family:"Arial","sans-serif"'>Mathematical Programming </span></em>89 (2000) 55--77. <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>45.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span class=SpellE><span style='font-size:9.0pt; font-family:"Arial","sans-serif";mso-fareast-font-family:"Times New Roman"'>A.RuszczyDski</span></span><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: "Times New Roman"'>, Dynamics aggregation in stochastic control problems, <em><span style='font-family:"Arial","sans-serif"'>Journal of Optimization Theory and Applications </span></em>105(3) (2000) 639--658. <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>46.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>M.C. Ferris and A. <span class=SpellE>RuszczyDski</span>, Robust path choice in networks with failures, <em><span style='font-family:"Arial","sans-serif"'>Networks </span></em>35 (2000) 181--194. <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>47.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>W. Ogryczak and A. <span class=SpellE>RuszczyDski</span>, <span class=GramE>From</span> stochastic dominance to mean--risk models: <span class=SpellE>Semideviations</span> as risk measures, <em><span style='font-family:"Arial","sans-serif"'>European Journal of Operational Research </span></em>116 (1999) 33--50. (<a href="http://dx.doi.org/10.1016/S0377-2217(98)00167-2" target="_parent"> doi:10.1016/S0377-2217(98)00167-2 </a>) <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>48.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span class=SpellE><span style='font-size:9.0pt; font-family:"Arial","sans-serif";mso-fareast-font-family:"Times New Roman"'>A.RuszczyDski</span></span><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: "Times New Roman"'>, Some advances in decomposition methods for stochastic linear programming, <em><span style='font-family:"Arial","sans-serif"'>Annals of Operations Research </span></em>85 (1999) 153--172 <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>49.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>K.C. <span class=SpellE>Kiwiel</span>, C.H. Rosa and A. <span class=SpellE>RuszczyDski</span>, <a href="%20http:/dx.doi.org/10.1137/S1052623495288064" target="_parent">Proximal decomposition via alternating linearization,</a> <em><span style='font-family: "Arial","sans-serif"'>SIAM Journal on Optimization </span></em>9 (1999) 153--172. <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>50.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>V.I. Norkin, G.Ch. Pflug and A. <span class=SpellE>RuszczyDski</span>, A branch and bound method for stochastic global optimization, <em><span style='font-family:"Arial","sans-serif"'>Mathematical Programming </span></em>83 (1998) 425--450. <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>51.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>G.Ch. Pflug, A. <span class=SpellE>RuszczyDski</span> and R. Schultz, On the <span class=SpellE>Glivenko</span>--<span class=SpellE>Cantelli</span> problem in stochastic programming: mixed-integer linear recourse, <em><span style='font-family:"Arial","sans-serif"'>Mathematical Methods of Operations Research (ZOR) </span></em>47 (1998) 39--49. <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>52.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>G.Ch. Pflug, A. <span class=SpellE>RuszczyDski</span> and R. Schultz, On the <span class=SpellE>Glivenko</span>--<span class=SpellE>Cantelli</span> problem in stochastic programming: linear <span class=SpellE>nd</span> convex recourse, <em><span style='font-family:"Arial","sans-serif"'>Mathematics of Operations Research </span></em>23 (1998) 204--220. <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>53.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>V.I. Norkin, <span class=SpellE>Yu.M</span>. <span class=SpellE>Ermoliev</span> and A. <span class=SpellE>RuszczyDski</span>, <span class=GramE>On</span> optimal allocation of <span class=SpellE>undivisibles</span> under uncertainty, Operations Research 46 (1998) 381--395. <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>54.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>A. <span class=SpellE>RuszczyDski</span>, A. <span class=SpellE>Swietanowski</span>, Accelerating the regularized decomposition method for two stage stochastic linear problems, <em><span style='font-family:"Arial","sans-serif"'>European Journal of Operational Research </span></em>101 (2) (1997) 328--342. <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>55.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>A. <span class=SpellE>RuszczyDski</span>, Decomposition methods in stochastic programming, <em><span style='font-family: "Arial","sans-serif"'>Mathematical Programming </span></em>79 (1997) 333--353. <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>56.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span class=SpellE><span style='font-size:9.0pt; font-family:"Arial","sans-serif";mso-fareast-font-family:"Times New Roman"'>Yu.M</span></span><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: "Times New Roman"'>. <span class=SpellE>Ermoliev</span>, A. <span class=SpellE>Kryazhimskii</span> and A. <span class=SpellE>RuszczyDski</span>, A constraint aggregation principle in convex optimization, <em><span style='font-family:"Arial","sans-serif"'>Mathematical Programming </span></em>76(1997) 353--372. <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>57.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span class=SpellE><span style='font-size:9.0pt; font-family:"Arial","sans-serif";mso-fareast-font-family:"Times New Roman"'>Yu.M</span></span><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: "Times New Roman"'>. <span class=SpellE>Ermoliev</span> and A. <span class=SpellE>RuszczyDski</span>, Convex optimization by radial search, <em><span style='font-family:"Arial","sans-serif"'>Journal of Optimization Theory and Applications </span></em>91(1996) 731--738. <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>58.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>C.H. Rosa and A. <span class=SpellE>RuszczyDski</span>, <span class=GramE>On</span> augmented <span class=SpellE>Lagrangian</span> decomposition methods for multistage stochastic programs, <em><span style='font-family:"Arial","sans-serif"'>Annals of Operations Research </span></em>64(1996) 289--309. <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>59.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>A. Altman, M. <span class=SpellE>Amann</span>, G. <span class=SpellE>Klaassen</span>, A. <span class=SpellE>RuszczyDski</span>, W. <span class=SpellE>Schöpp</span>, Cost-effective <span class=SpellE>sulphur</span> emission under uncertainty, <em><span style='font-family:"Arial","sans-serif"'>European Journal of Operational Research </span></em>90(1996) 395--412. <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>60.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>W. Gutjahr, G.Ch. Pflug and A. <span class=SpellE>RuszczyDski</span>, Configurations of series--parallel networks with maximum reliability, <span class=SpellE><em><span style='font-family:"Arial","sans-serif"'>Microelectron</span></em></span><em><span style='font-family:"Arial","sans-serif"'>. <span class=SpellE>Reliab</span>. </span></em>36(1996) 247--253. <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>61.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>J.M. <span class=SpellE>Mulvey</span> and A. <span class=SpellE>RuszczyDski</span>, A new scenario decomposition method for large-scale stochastic optimization, <em><span style='font-family: "Arial","sans-serif"'>Operations Research </span></em>43(1995) 477--490. <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>62.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>A. <span class=SpellE>RuszczyDski</span>, <span class=GramE>On</span> convergence of an augmented <span class=SpellE>Lagrangian</span> decomposition method for sparse convex optimization, <em><span style='font-family:"Arial","sans-serif"'>Mathematics of Operations Research </span></em>20(1995) 634--656. <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>63.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>A.J. Berger, J.M. <span class=SpellE>Mulvey</span> and A. <span class=SpellE>RuszczyDski</span>, An extension of the DQA algorithm to convex stochastic programs, <em><span style='font-family:"Arial","sans-serif"'>SIAM Journal on Optimization </span></em>4(1994) 735--753. <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>64.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>A. <span class=SpellE>RuszczyDski</span>, <a href="%0d%0ahttp:/www.springerlink.com/content/ht47488315528656/?p=6f5a7d1b4a7741259a6c6eb3fc3792ea&amp;pi=6" target="_parent">Parallel decomposition of multistage stochastic programming problems,</a> <em><span style='font-family:"Arial","sans-serif"'>Mathematical Programming </span></em>58(1993) 201--228. <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>65.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>J. Gondzio and A. <span class=SpellE>RuszczyDski</span>, Sensitivity method for basis inverse representation in multistage stochastic programming problems, <em><span style='font-family:"Arial","sans-serif"'>Journal of Optimization Theory and Applications </span></em>74(1992) 221--242. <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>66.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>J.M. <span class=SpellE>Mulvey</span> and A. <span class=SpellE>RuszczyDski</span>, A diagonal quadratic approximation method for large scale linear programs, <em><span style='font-family:"Arial","sans-serif"'>Operations Research Letters </span></em>12(1992) 205--215. <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>67.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>B. Arthur and A. <span class=SpellE>RuszczyDski</span>, Strategic pricing in markets with a conformity effect, <em><span style='font-family:"Arial","sans-serif"'>Archives of Control Sciences </span></em>1(XXXVII<span class=GramE>)(</span>1992) 7--31. <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>68.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>A. <span class=SpellE>RuszczyDski</span>, An augmented <span class=SpellE>Lagrangian</span> decomposition method for block diagonal linear programming problems, <em><span style='font-family:"Arial","sans-serif"'>Operations Research Letters </span></em>8(1989) 287--294. <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>69.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>A. <span class=SpellE>RuszczyDski</span>, A linearization method for <span class=SpellE>nonsmooth</span> stochastic optimization problems, <em><span style='font-family:"Arial","sans-serif"'>Mathematics of Operations Research </span></em>12(1987) 32--49. <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>70.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>A. <span class=SpellE>RuszczyDski</span>,<a href="%0d%0ahttp:/www.springerlink.com/content/g05044vnp2427975/?p=e1cd3d58b36f459a9c27cfeacf16da3e&amp;pi=0" target="_parent"> A regularized decomposition method for minimizing a sum of polyhedral functions</a>, <em><span style='font-family:"Arial","sans-serif"'>Mathematical Programming </span></em>35(1986) 309--333. <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>71.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>A. <span class=SpellE>RuszczyDski</span> and W. <span class=SpellE>Syski</span>, <span class=GramE>On</span> convergence of the stochastic <span class=SpellE>subgradient</span> method with on-line <span class=SpellE>stepsize</span> rules, <em><span style='font-family:"Arial","sans-serif"'>Journal of Mathematical Analysis and Applications </span></em>114(1986) 512--527. <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>72.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>A. <span class=SpellE>RuszczyDski</span> and W. <span class=SpellE>Syski</span>, A method of aggregate stochastic <span class=SpellE>subgradients</span> with on-line <span class=SpellE>stepsize</span> rules for convex stochastic programming problems, <em><span style='font-family: "Arial","sans-serif"'>Mathematical Programming Study </span></em>28(1986) 113--131. <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>73.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>A. <span class=SpellE>RuszczyDski</span>, A recursive quadratic programming algorithm for constrained stochastic programming problems, <em><span style='font-family:"Arial","sans-serif"'>Control and Cybernetics </span></em>13 (1984) 59--72. <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>74.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>A. <span class=SpellE>RuszczyDski</span> and M. <span class=SpellE>Styblinski</span>, Stochastic approximation approach to statistical circuit design, <em><span style='font-family:"Arial","sans-serif"'>Electronics Letters </span></em>19(1983) 300--302. <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>75.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>A. <span class=SpellE>RuszczyDski</span> and W. <span class=SpellE>Syski</span>, Stochastic approximation algorithm with gradient averaging for unconstrained problems, <em><span style='font-family: "Arial","sans-serif"'>IEEE Transactions on Automatic Control </span></em>AC--28(1983) 1097--1105. <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>76.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>A. <span class=SpellE>RuszczyDski</span>, Stochastic feasible direction methods for <span class=SpellE>nonsmooth</span> stochastic optimization problems, <em><span style='font-family:"Arial","sans-serif"'>Control and Cybernetics </span></em>9(1980) 173--187. <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>77.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>A. <span class=SpellE>RuszczyDski</span>, <a href="http://www.springerlink.com/content/p85l67586t817165/?p=6f5a7d1b4a7741259a6c6eb3fc3792ea&amp;pi=2" target="_parent">Feasible direction methods for stochastic programming problems</a>, <em><span style='font-family:"Arial","sans-serif"'>Mathematical Programming </span></em>19(1980) 220--229. <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>78.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>A. <span class=SpellE>RuszczyDski</span> and J. <span class=SpellE>Szymanowski</span>, Convergence analysis for two-level algorithms of mathematical programming, <em><span style='font-family: "Arial","sans-serif"'>Mathematical <span class=SpellE>Programmming</span> Study </span></em>10(1979) 158--171. <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>79.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>A. <span class=SpellE>RuszczyDski</span>, Coordination of <span class=SpellE>nonstationary</span> systems, <em><span style='font-family:"Arial","sans-serif"'>IEEE Transactions on Automatic Control </span></em>AC--24(1979) 51--62. <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>80.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>A. <span class=SpellE>RuszczyDski</span>, Convergence conditions for the interaction balance algorithm based on an approximate mathematical model, <em><span style='font-family:"Arial","sans-serif"'>Control and Cybernetics </span></em>5(1976) 29--43. <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l1 level1 lfo2;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>81.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>K. Malinowski and A. <span class=SpellE>RuszczyDski</span>, Application of an interaction balance method to process coordination, <em><span style='font-family:"Arial","sans-serif"'>Control and Cybernetics </span></em>4(1975) 15--31. <o:p></o:p></span></p> <div class=MsoNormal align=center style='text-align:center'><span class=sans1><span style='font-size:9.0pt;mso-fareast-font-family:"Times New Roman"'> <hr size=2 width="100%" align=center> </span></span></div> <h4><a name=pubs2></a><span style='mso-bookmark:pubs2'><span style='font-family: "Arial","sans-serif";mso-fareast-font-family:"Times New Roman";mso-no-proof: yes'><img border=0 width=16 height=16 id="_x0000_i1033" src="ball_gr.gif"></span></span><span style='mso-bookmark:pubs2'><span style='font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>Other Refereed Publications </span></span></h4> <span style='mso-bookmark:pubs2'></span> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l0 level1 lfo4;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>1.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp;&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>A. <span class=SpellE>RuszczyDski</span>, A. Shapiro, <a href="http://ideas.repec.org/p/wpa/wuwpri/0407002.html" target="_parent">Optimization of Risk Measures </a>, in: G. Calafiore and F, <span class=SpellE>Dabbene</span> (Eds.) <em><span style='font-family:"Arial","sans-serif"'>Probabilistic and Randomized Methods for Design under Uncertainty</span></em>, Springer-<span class=SpellE>Verlag</span>, London 2006, pp. 119-157. <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l0 level1 lfo4;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>2.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp;&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>G. Ch. Pflug and A. <span class=SpellE>RuszczyDski</span>, A risk measure for income processes, in: G. <span class=SpellE>Szego</span> (Ed.), <em><span style='font-family:"Arial","sans-serif"'>Risk measures for 21st <span class=GramE>Century <span style='font-style:normal'>,</span></span></span></em> Wiley, <span class=SpellE>Chichester</span> 2004, pp. 249--268. <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l0 level1 lfo4;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>3.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp;&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>B.J. <span class=SpellE>Lence</span> and A. <span class=SpellE>RuszczyDski</span>, Managing water quality under uncertainty: application of a new stochastic branch and bound method, in: <em><span style='font-family:"Arial","sans-serif"'>Risk, Reliability, Uncertainty and Robustness of Water Resources Systems</span></em>, Cambridge University Press, Cambridge, U.K., 2004. <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l0 level1 lfo4;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>4.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp;&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>A. <span class=SpellE>RuszczyDski</span>, On regularized duality in convex optimization, in: <em><span style='font-family: "Arial","sans-serif"'>Recent Advances in <span class=SpellE>Nonsmooth</span> Optimization</span></em>, D.Z. Du, L. <span class=SpellE>Qi</span> and R.S. <span class=SpellE>Womersley</span> (eds.), World Scientific, Singapore 1995, pp. 381--391. <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l0 level1 lfo4;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>5.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp;&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>A. <span class=SpellE>RuszczyDski</span>, On the regularized decomposition method for stochastic programming problems, in: <em><span style='font-family:"Arial","sans-serif"'>Stochastic Programming: Numerical Techniques and Engineering Applications</span></em>, K. Marti and P. <span class=SpellE>Kall</span> (eds.), <em><span style='font-family:"Arial","sans-serif"'>Lecture Notes in Control and Information Sciences</span></em> 423(1995), Springer-<span class=SpellE>Verlag</span>, Berlin 1995, pp. 93--108. <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l0 level1 lfo4;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>6.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp;&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>W.B. Arthur and A. <span class=SpellE>RuszczyDski</span>, Strategic pricing in markets with increasing returns, in: W.B. Arthur (ed.), <em><span style='font-family:"Arial","sans-serif"'>Increasing Returns and Path-Dependence in the Economy</span></em>, The University of Michigan Press, Ann Arbor, 1994, pp. 159--184. <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l0 level1 lfo4;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>7.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp;&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>A.J. Berger, J.M. <span class=SpellE>Mulvey</span> and A. <span class=SpellE>RuszczyDski</span>, Restarting strategies for the DQA algorithm, in: <em><span style='font-family: "Arial","sans-serif"'>Large Scale Optimization: State of the Art</span></em>, W. Hager, D. Hearn and P. Pardalos (eds.), <span class=SpellE>Kluwer</span> Academic Publishers 1994, pp. 1--25. <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l0 level1 lfo4;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>8.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp;&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>J.M. <span class=SpellE>Mulvey</span> and A. <span class=SpellE>RuszczyDski</span>, A diagonal quadratic approximation method for linear multistage stochastic programming problems, in: <em><span style='font-family:"Arial","sans-serif"'>System <span class=SpellE>Modelling</span> and Optimization</span></em>, P. <span class=SpellE>Kall</span> (ed.), <em><span style='font-family:"Arial","sans-serif"'>Lecture Notes in Control and Information Sciences</span></em> 180(1992), Springer-<span class=SpellE>Verlag</span>, Berlin 1992, pp.588--597. <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l0 level1 lfo4;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>9.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp;&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>A. <span class=SpellE>RuszczyDski</span>, Regularized decomposition and augmented <span class=SpellE>Lagrangian</span> decomposition for angular linear programming problems, in: <em><span style='font-family:"Arial","sans-serif"'>Aspiration Based Decision Support Systems</span></em>, A. Lewandowski and A. <span class=SpellE>Wierzbicki</span> (eds.), <em><span style='font-family:"Arial","sans-serif"'>Lecture Notes in Economics and Mathematical Systems</span></em> 331(1989), Springer-<span class=SpellE>Verlag</span>, Berlin 1989, pp. 80--91. <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l0 level1 lfo4;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>10.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>J Gondzio and A. <span class=SpellE>RuszczyDski</span>, A sensitivity method for solving multistage linear programming problems, in: <em><span style='font-family:"Arial","sans-serif"'>Aspiration Based Decision Support Systems</span></em>, A. Lewandowski and A. <span class=SpellE>Wierzbicki</span> (eds.), <em><span style='font-family:"Arial","sans-serif"'>Lecture Notes in Economics and Mathematical Systems </span></em>331(1989), Springer-<span class=SpellE>Verlag</span>, Berlin 1989, pp. 68--79. <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l0 level1 lfo4;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>11.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>A. <span class=SpellE>RuszczyDski</span>, Modern techniques for linear dynamic and stochastic programs, in: <em><span style='font-family:"Arial","sans-serif"'>Aspiration Based Decision Support Systems</span></em>, A. Lewandowski and A. <span class=SpellE>Wierzbicki</span> (eds.), <em><span style='font-family:"Arial","sans-serif"'>Lecture Notes in Economics and Mathematical Systems </span></em>331(1989), Springer-<span class=SpellE>Verlag</span>, Berlin 1989, pp. 48--67. <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l0 level1 lfo4;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>12.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>P. <span class=SpellE>Kall</span>, A. <span class=SpellE>RuszczyDski</span> and K. <span class=SpellE>Frauendorfer</span>, Approximation techniques in stochastic programming, in: <em><span style='font-family:"Arial","sans-serif"'>Numerical Methods for Stochastic Optimization</span></em>, <span class=SpellE>Yu.M</span>. <span class=SpellE>Ermoliev</span> and R. Wets (eds.), Springer-<span class=SpellE>Verlag</span>, 1987. <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l0 level1 lfo4;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>13.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>A. <span class=SpellE>RuszczyDski</span>, A method of feasible directions for solving <span class=SpellE>nonsmooth</span> stochastic programming problems, in: <em><span style='font-family:"Arial","sans-serif"'>Stochastic Programming </span></em>, F. <span class=SpellE>Archetti</span>, G. Di <span class=SpellE>Pillo</span> and M. <span class=SpellE>Lucertini</span> (eds.), <em><span style='font-family:"Arial","sans-serif"'>Lecture Notes on Control and Inf. Sci.</span></em> 76(1986), Springer-<span class=SpellE>Verlag</span>, Berlin 1986, pp. 258--271. <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l0 level1 lfo4;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>14.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>A. <span class=SpellE>RuszczyDski</span> and W. <span class=SpellE>Syski</span>, Stochastic approximation algorithm with gradient averaging and on-line <span class=SpellE>stepsize</span> rules, <em><span style='font-family:"Arial","sans-serif"'>Proceedings of 9th IFAC World Congress</span></em> (J. <span class=SpellE>Gertler</span> and L. <span class=SpellE>Keviczky</span>, eds.), Budapest 1984. <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l0 level1 lfo4;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>15.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>A. <span class=SpellE>RuszczyDski</span>, <span class=SpellE>Nonsmooth</span> functions in hierarchical control problems, in <em><span style='font-family:"Arial","sans-serif"'>Progress in <span class=SpellE>Nondifferentiable</span> Optimization</span></em>, E. <span class=SpellE>Nurminski</span> (ed.), <span class=GramE>North</span>--Holland, 1982, pp. 145--172. <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l0 level1 lfo4;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>16.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>A. <span class=SpellE>RuszczyDski</span>, <span class=GramE>On</span> convergence of quasi-Newton methods for nonlinearly constrained optimization problems, in <em><span style='font-family:"Arial","sans-serif"'>Methods of Mathematical Programming</span></em>, Polish Scientific Publishers, Warsaw, 1981, pp. 277--281. <o:p></o:p></span></p> <p class=MsoNormal style='mso-margin-top-alt:auto;mso-margin-bottom-alt:auto; margin-left:.5in;text-indent:-.25in;mso-list:l0 level1 lfo4;tab-stops:list .5in'><![if !supportLists]><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-fareast-font-family: Arial'><span style='mso-list:Ignore'>17.<span style='font:7.0pt "Times New Roman"'>&nbsp;&nbsp; </span></span></span><![endif]><span style='font-size:9.0pt;font-family:"Arial","sans-serif"; mso-fareast-font-family:"Times New Roman"'>A. <span class=SpellE>RuszczyDski</span> and J. <span class=SpellE>Szymanowski</span>, An accuracy selection algorithm for the modified gradient projection method in min--max problems, <em><span style='font-family:"Arial","sans-serif"'>Lecture Notes on Control and Inf. Sci.</span></em> 7(1978), Springer-<span class=SpellE>Verlag</span>, Berlin 1978, pp. 169--178. <o:p></o:p></span></p> <p><span style='font-size:9.0pt;font-family:"Arial","sans-serif";mso-no-proof: yes'><img border=0 width=800 height=5 id="_x0000_i1032" src=redline.gif></span><span style='font-size:9.0pt;font-family:"Arial","sans-serif"'><o:p></o:p></span></p> </div> </body> </html>