Developing an Enhanced Algorithms to Solve Mixed Integer Non-Linear Programming Problems Based on a Feasible Neighborhood Search Strategy

Engineering optimization problems often involve nonlinear objective functions, which can capture complex relationships and dependencies between variables. This study focuses on a unique nonlinear mathematics programming problem characterized by a subset of variables that can only take discrete value...

Full description

Saved in:
Bibliographic Details
Published in:Register Vol. 9; no. 2; pp. 112 - 121
Main Authors: Wahyudi, Mochamad, Firmansyah, Firmansyah, Sihotang, Hengki Tamando, Pujiastuti, Lise, Mawengkang, Herman
Format: Journal Article
Language:English
Published: 19.08.2023
ISSN:2503-0477, 2502-3357
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract Engineering optimization problems often involve nonlinear objective functions, which can capture complex relationships and dependencies between variables. This study focuses on a unique nonlinear mathematics programming problem characterized by a subset of variables that can only take discrete values and are linearly separable from the continuous variables. The combination of integer variables and non-linearities makes this problem much more complex than traditional nonlinear programming problems with only continuous variables. Furthermore, the presence of integer variables can result in a combinatorial explosion of potential solutions, significantly enlarging the search space and making it challenging to explore effectively. This issue becomes especially challenging for larger problems, leading to long computation times or even infeasibility. To address these challenges, we propose a method that employs the "active constraint" approach in conjunction with the release of nonbasic variables from their boundaries. This technique compels suitable non-integer fundamental variables to migrate to their neighboring integer positions. Additionally, we have researched selection criteria for choosing a nonbasic variable to use in the integerizing technique. Through implementation and testing on various problems, these techniques have proven to be successful.
AbstractList Engineering optimization problems often involve nonlinear objective functions, which can capture complex relationships and dependencies between variables. This study focuses on a unique nonlinear mathematics programming problem characterized by a subset of variables that can only take discrete values and are linearly separable from the continuous variables. The combination of integer variables and non-linearities makes this problem much more complex than traditional nonlinear programming problems with only continuous variables. Furthermore, the presence of integer variables can result in a combinatorial explosion of potential solutions, significantly enlarging the search space and making it challenging to explore effectively. This issue becomes especially challenging for larger problems, leading to long computation times or even infeasibility. To address these challenges, we propose a method that employs the "active constraint" approach in conjunction with the release of nonbasic variables from their boundaries. This technique compels suitable non-integer fundamental variables to migrate to their neighboring integer positions. Additionally, we have researched selection criteria for choosing a nonbasic variable to use in the integerizing technique. Through implementation and testing on various problems, these techniques have proven to be successful.
Author Pujiastuti, Lise
Wahyudi, Mochamad
Sihotang, Hengki Tamando
Mawengkang, Herman
Firmansyah, Firmansyah
Author_xml – sequence: 1
  givenname: Mochamad
  surname: Wahyudi
  fullname: Wahyudi, Mochamad
– sequence: 2
  givenname: Firmansyah
  surname: Firmansyah
  fullname: Firmansyah, Firmansyah
– sequence: 3
  givenname: Hengki Tamando
  surname: Sihotang
  fullname: Sihotang, Hengki Tamando
– sequence: 4
  givenname: Lise
  surname: Pujiastuti
  fullname: Pujiastuti, Lise
– sequence: 5
  givenname: Herman
  surname: Mawengkang
  fullname: Mawengkang, Herman
BookMark eNp9kE1OwzAQRi1UJErpCdj4AimOHednWUoLlUpBKqwj25kklhK7sqOKHoFb4xbYsGA1I828b0bvGo2MNYDQbUxmNOVFcueg0X4ANzsUms5YRtILNKac0Igxno3OPYtIkmVXaOq9luTMZXEyRp8PcIDO7rVpsDB4aVphFFR43jXW6aHtPR4s3tnuAPhZf4TJ2gzQgMNba6KNNiAcfnW2caLvTyGhlx0E7F74sG0NFngFIlztAG9BN620rrW2wruAqhbvBidC4vEGXdai8zD9qRP0vlq-LZ6izcvjejHfRIqSIo1YAiKvY1XQXKaMKslqGisKKq-ZkrKOgbG6JlDlKgWaSlLlXDIec8IrLjLOJoh95ypnvXdQl3une-GOZUzKs5jyV2h5ElqehAaq-EMpPYhBWxPe192_7BeHUYUv
CitedBy_id crossref_primary_10_1016_j_egyr_2025_06_009
ContentType Journal Article
DBID AAYXX
CITATION
DOI 10.26594/register.v9i2.3706
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList CrossRef
DeliveryMethod fulltext_linktorsrc
EISSN 2502-3357
EndPage 121
ExternalDocumentID 10_26594_register_v9i2_3706
GroupedDBID AAYXX
ALMA_UNASSIGNED_HOLDINGS
CITATION
M~E
ID FETCH-LOGICAL-c2096-34ea8f1c928b632cb3f21c2ec8f3cbbf1e33ff0ed8c6e26b0d85b351505d5a753
ISSN 2503-0477
IngestDate Tue Nov 18 22:28:01 EST 2025
Sat Nov 29 03:25:56 EST 2025
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed false
IsScholarly true
Issue 2
Language English
License http://creativecommons.org/licenses/by-nc-sa/4.0
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c2096-34ea8f1c928b632cb3f21c2ec8f3cbbf1e33ff0ed8c6e26b0d85b351505d5a753
OpenAccessLink https://journal.unipdu.ac.id/index.php/register/article/download/3706/1614
PageCount 10
ParticipantIDs crossref_primary_10_26594_register_v9i2_3706
crossref_citationtrail_10_26594_register_v9i2_3706
PublicationCentury 2000
PublicationDate 2023-08-19
PublicationDateYYYYMMDD 2023-08-19
PublicationDate_xml – month: 08
  year: 2023
  text: 2023-08-19
  day: 19
PublicationDecade 2020
PublicationTitle Register
PublicationYear 2023
SSID ssib026594714
ssib044758109
ssib026971706
Score 2.2287385
Snippet Engineering optimization problems often involve nonlinear objective functions, which can capture complex relationships and dependencies between variables. This...
SourceID crossref
SourceType Enrichment Source
Index Database
StartPage 112
Title Developing an Enhanced Algorithms to Solve Mixed Integer Non-Linear Programming Problems Based on a Feasible Neighborhood Search Strategy
Volume 9
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 2502-3357
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssib044758109
  issn: 2503-0477
  databaseCode: M~E
  dateStart: 20150101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3Nb9MwFLfK4MAFgQAxvuQDt5JR220SHwcU7cCmCoq0W-XYzhponalNq-6y-_5G_hme7TgJA03swCVqLOep8vv5-b3n94HQG9j-MSG5ihicztZ1Q6JMUAZWCs-FklQoPXDNJpKTk_T0lE96vZ8hF2a7SIxJdzt-_l9ZDWPAbJs6ewt2N0RhAH4D0-EJbIfnPzH-Y5sGBXt3bOb-jv9wcVauimq-dCUdvpYL23Wo2GnlnIIu97c0EZimtrLPxEdtLS2RiW85s-6_hwNP2csF0QfFEbbSwoZHgnEPMHLFkX3ocr8uePvbffEXbRONOpHAYn6xUS6S4LiUc7EUqkFSYfMY1hfCOXzat8YXVMzLqvZyH2lz9qPoT-F7o8pGzG--F2JdbXykwueivn-qfRsAEVtrlrciEPQzGBvWjV50GKMRY76sdZDhvANV2pHHpI7R9kc78cnY108NGo_4ENi6qpfiYMsLesCSwV9qdF87O5uIRrClHJlZIDKzRGaWyB10lyYjbkXu8eU4CDs3O2mvsGnME1vKKLzbQowpcSFKzSr4qlnuy3d__tmOZtVRkaYP0YPatsGHHpOPUE-bx-iqxSMWBgc84haPuCqxwyN2eMQ1HnGLR9zBIw54xA6PuDRY4IBH3MUj9njEAY9P0LdP4-mHo6ju_xFJCpY1iA8t0pxITtMsZlRmLKdEUi3TnMksy4lmLM8HWqUy1jTOBiodZQwU9MFIjQTY4U_RnimNfoYw4UQJluWKMDaUnGQx2N2CwnTNJehw-4iGtZvJuji-7dGymN3A2H30tvno3NeGuWn689tNf4Hut1viJdqrVhv9Ct2T26pYr147LP0CEsa72w
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=Developing+an+Enhanced+Algorithms+to+Solve+Mixed+Integer+Non-Linear+Programming+Problems+Based+on+a+Feasible+Neighborhood+Search+Strategy&rft.jtitle=Register&rft.au=Wahyudi%2C+Mochamad&rft.au=Firmansyah%2C+Firmansyah&rft.au=Sihotang%2C+Hengki+Tamando&rft.au=Pujiastuti%2C+Lise&rft.date=2023-08-19&rft.issn=2503-0477&rft.eissn=2502-3357&rft.volume=9&rft.issue=2&rft.spage=112&rft.epage=121&rft_id=info:doi/10.26594%2Fregister.v9i2.3706&rft.externalDBID=n%2Fa&rft.externalDocID=10_26594_register_v9i2_3706
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2503-0477&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2503-0477&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2503-0477&client=summon