Direct Search Techniques for Mixed Stochastic Nonlinear Programming Model

Stochastic programming is a methodology utilized for the purpose of achieving optimal planning and decision-making outcomes when faced with uncertain data. The subject of investigation pertains to a stochastic optimization problem wherein the results of stochastic data are not disclosed during runti...

Full description

Saved in:
Bibliographic Details
Published in:Sinkron Vol. 8; no. 3; pp. 1287 - 1298
Main Authors: Tanjung, Ilyas, Mawengkang, Herman, Sawaluddin, Sawaluddin
Format: Journal Article
Language:English
Published: 01.07.2023
ISSN:2541-044X, 2541-2019
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract Stochastic programming is a methodology utilized for the purpose of achieving optimal planning and decision-making outcomes when faced with uncertain data. The subject of investigation pertains to a stochastic optimization problem wherein the results of stochastic data are not disclosed during runtime, and the optimization of the decision does not necessitate foresight into forthcoming outcomes. This establishes a strong correlation with the imperative need for immediate optimization in uncertain data settings, enabling effective decision-making in the present moment. The present study introduces a novel methodology for achieving global optimization of the model for nonlinear mixed-stochastic programming problem. The present study centers on stochastic problems that are two-staged and entail non-linearities in both the objective function and constraints. The first stage variables are discrete in nature, whereas the second stage variables are a combination of continuous and mixed types. Scenario-based representations are utilized for formulating problems. The fundamental approach to address the non-linear mixed-stochastic programming problem involves converting the model into a deterministic non-linear mixed-count program that is equivalent in form. The feasibility of this proposition stems from the discrete distribution assumption of uncertainty, which can be represented by a limited set of scenarios. The magnitude of the model size will increase significantly due to the quantity of scenarios and time horizons involved. The utilization of filtered probability space in conjunction with data mining techniques will be employed for the purpose of scenario generation. The methodology employed for addressing nonlinear mixed-integer programming problems of significant scale involves elevating the value of a non-basic variable beyond its boundaries in order to compel a basis variable to attain a cumulative value. Subsequently, the problem is simplified by maintaining a constant count variable and modifying it incrementally in discrete intervals to achieve an optimal solution at a global level.
AbstractList Stochastic programming is a methodology utilized for the purpose of achieving optimal planning and decision-making outcomes when faced with uncertain data. The subject of investigation pertains to a stochastic optimization problem wherein the results of stochastic data are not disclosed during runtime, and the optimization of the decision does not necessitate foresight into forthcoming outcomes. This establishes a strong correlation with the imperative need for immediate optimization in uncertain data settings, enabling effective decision-making in the present moment. The present study introduces a novel methodology for achieving global optimization of the model for nonlinear mixed-stochastic programming problem. The present study centers on stochastic problems that are two-staged and entail non-linearities in both the objective function and constraints. The first stage variables are discrete in nature, whereas the second stage variables are a combination of continuous and mixed types. Scenario-based representations are utilized for formulating problems. The fundamental approach to address the non-linear mixed-stochastic programming problem involves converting the model into a deterministic non-linear mixed-count program that is equivalent in form. The feasibility of this proposition stems from the discrete distribution assumption of uncertainty, which can be represented by a limited set of scenarios. The magnitude of the model size will increase significantly due to the quantity of scenarios and time horizons involved. The utilization of filtered probability space in conjunction with data mining techniques will be employed for the purpose of scenario generation. The methodology employed for addressing nonlinear mixed-integer programming problems of significant scale involves elevating the value of a non-basic variable beyond its boundaries in order to compel a basis variable to attain a cumulative value. Subsequently, the problem is simplified by maintaining a constant count variable and modifying it incrementally in discrete intervals to achieve an optimal solution at a global level.
Author Sawaluddin, Sawaluddin
Tanjung, Ilyas
Mawengkang, Herman
Author_xml – sequence: 1
  givenname: Ilyas
  surname: Tanjung
  fullname: Tanjung, Ilyas
– sequence: 2
  givenname: Herman
  surname: Mawengkang
  fullname: Mawengkang, Herman
– sequence: 3
  givenname: Sawaluddin
  surname: Sawaluddin
  fullname: Sawaluddin, Sawaluddin
BookMark eNotkM1OAyEYRYmpibX2CdzwAlNhgBlYmvrTJq2adBbuCMN8tMQWFEajb-9Yuzp3cXIX5xKNQgyA0DUlM8aYEjfZh7cUw-xLejajpeDlGRoPoEVJqBqdNuH89QJNc_YtEbQig1aN0fLOJ7A93oBJdocbsLvgPz4hYxcTXvtv6PCmj3Zncu8tfoph78Pg4pcUt8kcDj5s8Tp2sL9C587sM0xPnKDm4b6ZL4rV8-NyfrsqrFRlIY1RloNiFe-IqC0nLXVUUNka7upatEpJ6ISShgHpoCKODg53wF1ZOy7ZBLH_W5tizgmcfk_-YNKPpkQfe-hTD_3XQx97sF-tB1jg
ContentType Journal Article
DBID AAYXX
CITATION
DOI 10.33395/sinkron.v8i3.12542
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList CrossRef
DeliveryMethod fulltext_linktorsrc
EISSN 2541-2019
EndPage 1298
ExternalDocumentID 10_33395_sinkron_v8i3_12542
GroupedDBID AAYXX
ALMA_UNASSIGNED_HOLDINGS
CITATION
M~E
ID FETCH-LOGICAL-c892-8aa9c4e9364d057c40b1f1518ba4f775b998ed598a3e0de60f1c404fe4f27f483
ISSN 2541-044X
IngestDate Sat Nov 29 03:42:19 EST 2025
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed false
IsScholarly false
Issue 3
Language English
License http://creativecommons.org/licenses/by-nc/4.0
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c892-8aa9c4e9364d057c40b1f1518ba4f775b998ed598a3e0de60f1c404fe4f27f483
OpenAccessLink https://jurnal.polgan.ac.id/index.php/sinkron/article/download/12542/1721
PageCount 12
ParticipantIDs crossref_primary_10_33395_sinkron_v8i3_12542
PublicationCentury 2000
PublicationDate 2023-07-01
PublicationDateYYYYMMDD 2023-07-01
PublicationDate_xml – month: 07
  year: 2023
  text: 2023-07-01
  day: 01
PublicationDecade 2020
PublicationTitle Sinkron
PublicationYear 2023
SSID ssib051605426
Score 1.8366044
Snippet Stochastic programming is a methodology utilized for the purpose of achieving optimal planning and decision-making outcomes when faced with uncertain data. The...
SourceID crossref
SourceType Index Database
StartPage 1287
Title Direct Search Techniques for Mixed Stochastic Nonlinear Programming Model
Volume 8
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 2541-2019
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssib051605426
  issn: 2541-044X
  databaseCode: M~E
  dateStart: 20160101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Nb9QwELWWwoELAgHio1Q-cFuyJLET28eqatUedoXUPfQWTWwHFpa02rbb7YXf3rGdTcyHED1wiRIrGcWZp_EbZ_xMyPsMuFA5ZEkD2iS8qHUiVYk5D5S5LnMBRku_2YSYzeTZmfo0Gt1u18Ksl6Jt5WajLv6rq7ENne2Wzt7D3b1RbMBzdDoe0e14_CfHhyA2DnXEYercabR63YXxdLHxDPNcfwGn0DyeBakMWLklA65S67ubO3A7pC1j3nqKKetq-GM_h_ZrFyVOlrfQ8_Ip3Nj287duDvrYRf3-mVO4geW1MUG0YLiK5x1y1teoduEJM8ssSXmor5zYoQ0phYrjq4xgxKJYiSOjiMZdJB7yTzGdMaac_sVl6OhkLRdsgrQsiHL9rKD9y8jW1xtipuPNVJ2RyhmpvJEH5GEuCuVi-vTH4TYUFRmmedxv1tf3M2hWeTsff3-ZiNdEBGX-lDzpMgu6HxDxjIxs-5ycBDTQgAY6oIEiGqhHAx3QQHs00AgN1KPhBZkfHc4PjpNu94xES4WjHIDS3CpWcoOcXPO0zhqkd7IG3ghR1JhnW1MoCcymxpZpk-E9vLG8yUXDJXtJdtrz1r4iNG1SzNKhYNzJNYJQNWQWubIxSkhkrK_Jh23Xq4ugkVL95Yu_ud_tb8njAX67ZOdqdW3fkUd6fbW4XO15r90BzbRk_w
linkProvider ISSN International Centre
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Direct+Search+Techniques+for+Mixed+Stochastic+Nonlinear+Programming+Model&rft.jtitle=Sinkron&rft.au=Tanjung%2C+Ilyas&rft.au=Mawengkang%2C+Herman&rft.au=Sawaluddin%2C+Sawaluddin&rft.date=2023-07-01&rft.issn=2541-044X&rft.eissn=2541-2019&rft.volume=8&rft.issue=3&rft.spage=1287&rft.epage=1298&rft_id=info:doi/10.33395%2Fsinkron.v8i3.12542&rft.externalDBID=n%2Fa&rft.externalDocID=10_33395_sinkron_v8i3_12542
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2541-044X&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2541-044X&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2541-044X&client=summon