{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T22:48:47Z","timestamp":1776206927413,"version":"3.50.1"},"reference-count":37,"publisher":"MDPI AG","issue":"2","license":[{"start":{"date-parts":[[2024,2,19]],"date-time":"2024-02-19T00:00:00Z","timestamp":1708300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"LA Comp Chair and the John and Mary Moore Chair at the University of Oklahoma"},{"name":"Pietz Professorship funds"},{"name":"Research Affairs Office at South Dakota School of Mines and Technology"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>When dealing with engineering design problems, designers often encounter nonlinear and nonconvex features, multiple objectives, coupled decision making, and various levels of fidelity of sub-systems. To realize the design with limited computational resources, problems with the features above need to be linearized and then solved using solution algorithms for linear programming. The adaptive linear programming (ALP) algorithm is an extension of the Sequential Linear Programming algorithm where a nonlinear compromise decision support problem (cDSP) is iteratively linearized, and the resulting linear programming problem is solved with satisficing solutions returned. The reduced move coefficient (RMC) is used to define how far away from the boundary the next linearization is to be performed, and currently, it is determined based on a heuristic. The choice of RMC significantly affects the efficacy of the linearization process and, hence, the rapidity of finding the solution. In this paper, we propose a rule-based parameter-learning procedure to vary the RMC at each iteration, thereby significantly increasing the speed of determining the ultimate solution. To demonstrate the efficacy of the ALP algorithm with parameter learning (ALPPL), we use an industry-inspired problem, namely, the integrated design of a hot-rolling process chain for the production of a steel rod. Using the proposed ALPPL, we can incorporate domain expertise to identify the most relevant criteria to evaluate the performance of the linearization algorithm, quantify the criteria as evaluation indices, and tune the RMC to return the solutions that fall into the most desired range of each evaluation index. Compared with the old ALP algorithm using the golden section search to update the RMC, the ALPPL improves the algorithm by identifying the RMC values with better linearization performance without adding computational complexity. The insensitive region of the RMC is better explored using the ALPPL\u2014the ALP only explores the insensitive region twice, whereas the ALPPL explores four times throughout the iterations. With ALPPL, we have a more comprehensive definition of linearization performance\u2014given multiple design scenarios, using evaluation indices (EIs) including the statistics of deviations, the numbers of binding (active) constraints and bounds, the numbers of accumulated linear constraints, and the number of iterations. The desired range of evaluation indices (DEI) is also learned during the iterations. The RMC value that brings the most EIs into the DEI is returned as the best RMC, which ensures a balance between the accuracy of the linearization and the robustness of the solutions. For our test problem, the hot-rolling process chain, the ALP returns the best RMC in twelve iterations considering only the deviation as the linearization performance index, whereas the ALPPL returns the best RMC in fourteen iterations considering multiple EIs. The complexity of both the ALP and the ALPPL is O(n2). The parameter-learning steps can be customized to improve the parameter determination of other algorithms.<\/jats:p>","DOI":"10.3390\/a17020088","type":"journal-article","created":{"date-parts":[[2024,2,21]],"date-time":"2024-02-21T05:42:46Z","timestamp":1708494166000},"page":"88","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["An Adaptive Linear Programming Algorithm with Parameter Learning"],"prefix":"10.3390","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4365-216X","authenticated-orcid":false,"given":"Lin","family":"Guo","sequence":"first","affiliation":[{"name":"Department of Industrial Engineering, South Dakota School of Mines and Technology, Rapid City, SD 57701, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1690-1324","authenticated-orcid":false,"given":"Anand Balu","family":"Nellippallil","sequence":"additional","affiliation":[{"name":"Department of Mechanical and Civil Engineering, Florida Institute of Technology, Melbourne, FL 32901, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6799-1780","authenticated-orcid":false,"given":"Warren F.","family":"Smith","sequence":"additional","affiliation":[{"name":"Engineering and Technology, University of New South Wales, Canberra 2600, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0686-6764","authenticated-orcid":false,"given":"Janet K.","family":"Allen","sequence":"additional","affiliation":[{"name":"The Systems Realization Laboratory, The University of Oklahoma, Norman, OK 73019, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Farrokh","family":"Mistree","sequence":"additional","affiliation":[{"name":"The Systems Realization Laboratory, The University of Oklahoma, Norman, OK 73019, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2024,2,19]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"1247","DOI":"10.1007\/s10898-012-9951-y","article-title":"Derivative-Free Optimization: A Review of Algorithms and Comparison of Software Implementations","volume":"56","author":"Rios","year":"2013","journal-title":"J. Glob. Optim."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1007\/s43069-020-00021-4","article-title":"Particle Swarm Optimization for Computing Nash and Stackelberg Equilibria in Energy Markets","volume":"1","author":"Vrahatis","year":"2020","journal-title":"SN Oper. Res. Forum"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/s43069-021-00087-8","article-title":"A Comparison between Memetic Algorithm and Genetic Algorithm for an Integrated Logistics Network with Flexible Delivery Path","volume":"2","author":"Behmanesh","year":"2021","journal-title":"Oper. Res. Forum"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1016\/0098-1354(90)87085-4","article-title":"A Combined Penalty Function and Outer-Approximation Method for MINLP Optimization","volume":"14","author":"Viswanathan","year":"1990","journal-title":"Comput. Chem. Eng."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Nagadurga, T., Devarapalli, R., and Knypi\u0144ski, \u0141. (2023). Comparison of Meta-Heuristic Optimization Algorithms for Global Maximum Power Point Tracking of Partially Shaded Solar Photovoltaic Systems. Algorithms, 16.","DOI":"10.3390\/a16080376"},{"key":"ref_6","first-page":"251","article-title":"Compromise decision support problem and the adaptive linear programming algorithm","volume":"150","author":"Mistree","year":"1993","journal-title":"Prog. Astronaut. Aeronaut. Struct. Optim. Status Promise"},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Teng, Z., and Lu, L. (2019). A FEAST algorithm for the linear response eigenvalue problem. Algorithms, 12.","DOI":"10.3390\/a12090181"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"2127","DOI":"10.2514\/2.875","article-title":"Engineering design optimization using interior-point algorithms","volume":"38","author":"Rao","year":"2000","journal-title":"AIAA J."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Asghari, M., Fathollahi-Fard, A.M., Al-E-Hashem, S.M., and Dulebenets, M.A. (2022). Transformation and linearization techniques in optimization: A state-of-the-art survey. Mathematics, 10.","DOI":"10.3390\/math10020283"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"1053","DOI":"10.1038\/nature09710","article-title":"Genetic history of an archaic hominin group from Denisova Cave in Siberia","volume":"468","author":"Reich","year":"2010","journal-title":"Nature"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1287\/mnsc.14.5.335","article-title":"Utility theory","volume":"14","author":"Fishburn","year":"1968","journal-title":"Manag. Sci."},{"key":"ref_12","first-page":"155","article-title":"The bargaining problem","volume":"18","author":"Nash","year":"1950","journal-title":"Econom. J. Econom. Soc."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Saaty, T.L. (1988). What Is the Analytic Hierarchy Process?, Springer.","DOI":"10.13033\/isahp.y1988.042"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0305-0483(76)90054-2","article-title":"Some properties of Pareto-optimal choices in decision problems","volume":"4","author":"Calpine","year":"1976","journal-title":"Omega"},{"key":"ref_15","unstructured":"Guo, L. (2021). Model Evolution for the Realization of Complex Systems. [Ph.D. Thesis, University of Oklahoma]."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1021\/acs.iecr.1c03142","article-title":"Robust modifier adaptation via worst-case and probabilistic approaches","volume":"61","author":"Speakman","year":"2021","journal-title":"Ind. Eng. Chem. Res."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"1529","DOI":"10.1007\/s11590-015-0969-1","article-title":"Global convergence of a proximal linearized algorithm for difference of convex functions","volume":"10","author":"Souza","year":"2016","journal-title":"Optim. Lett."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"11665","DOI":"10.1016\/j.jfranklin.2023.09.016","article-title":"Adaptive parameter learning and neural network control for uncertain permanent magnet linear synchronous motors","volume":"360","author":"Su","year":"2023","journal-title":"J. Frankl. Inst."},{"key":"ref_19","unstructured":"Courant, R., and Hilbert, D. (1953). Methods of Mathematical Physics, Interscience."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"050801","DOI":"10.1115\/1.4064276","article-title":"Satisficing Strategy in Engineering Design","volume":"146","author":"Guo","year":"2024","journal-title":"J. Mech. Des."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1093\/comjnl\/7.2.155","article-title":"An Efficient Method for Finding the Minimum of a Function of Several Variables without Calculating Derivatives","volume":"7","author":"Powell","year":"1964","journal-title":"Comput. J."},{"key":"ref_22","unstructured":"Straeter, T.A. (1971). On the Extension of the Davidon-Broyden Class of Rank One, Quasi-Newton Minimization Methods to an Infinite Dimensional Hilbert Space with Applications to Optimal Control Problems, North Carolina State University."},{"key":"ref_23","unstructured":"Fletcher, R. (1987). Practical Methods of Optimization, John Wiley & Sons. [2nd ed.]."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0045-7930(81)90020-7","article-title":"A Conjugate Gradient Iterative Method","volume":"9","author":"Khosla","year":"1981","journal-title":"Comput. Fluids"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"770","DOI":"10.1137\/0721052","article-title":"Newton-type Minimization via the Lanczos Method","volume":"21","author":"Nash","year":"1984","journal-title":"SIAM J. Numer. Anal."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1145\/279232.279236","article-title":"Algorithm 778: L-BFGS-B: Fortran Subroutines for Large-scale Bound-Constrained Optimization","volume":"23","author":"Zhu","year":"1997","journal-title":"ACM Trans. Math. Softw. (TOMS)"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1007\/BF01589118","article-title":"A Tolerant Algorithm for Linearly Constrained Optimization Calculations","volume":"45","author":"Powell","year":"1989","journal-title":"Math. Program."},{"key":"ref_28","first-page":"170","article-title":"A View of Algorithms for Optimization without Derivatives","volume":"43","author":"Powell","year":"2007","journal-title":"Math. Today Bull. Inst. Math. Its Appl."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/4235.996017","article-title":"A fast and elitist multiobjective genetic algorithm: NSGA-II","volume":"6","author":"Deb","year":"2002","journal-title":"IEEE Trans. Evol. Comput."},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Guo, L., Balu Nellippallil, A., Smith, W.F., Allen, J.K., and Mistree, F. (2020, January 17\u201319). Adaptive Linear Programming Algorithm with Parameter Learning for Managing Engineering-Design Problems. Proceedings of the ASME 2020 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference, Online.","DOI":"10.1115\/DETC2020-22602"},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1115\/1.2826915","article-title":"A Procedure for Robust Design: Minimizing Variations Caused by Noise Factors and Control Factors","volume":"118","author":"Chen","year":"1996","journal-title":"J. Mech. Des."},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Maniezzo, V., and Zhou, T. (2023). Learning Individualized Hyperparameter Settings. Algorithms, 16.","DOI":"10.3390\/a16060267"},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"106297","DOI":"10.1016\/j.cor.2023.106297","article-title":"Heuristic algorithm for nested Markov decision process: Solution quality and computational complexity","volume":"159","author":"Fianu","year":"2023","journal-title":"Comput. Oper. Res."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"109562","DOI":"10.1016\/j.cie.2023.109562","article-title":"New statistical and machine learning based control charts with variable parameters for monitoring generalized linear model profiles","volume":"184","author":"Sabahno","year":"2023","journal-title":"Comput. Ind. Eng."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/s10820-005-1056-1","article-title":"An Approach for Robust Design of Reactive Power Metal Mixtures based on Non-Deterministic Micro-Scale Shock Simulation","volume":"12","author":"Choi","year":"2005","journal-title":"J. Comput. Aided Mater. Des."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"111403","DOI":"10.1115\/1.4041050","article-title":"An inverse, decision-based design method for integrated design exploration of materials, products, and manufacturing processes","volume":"140","author":"Nellippallil","year":"2018","journal-title":"J. Mech. Des."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"106530","DOI":"10.1016\/j.cor.2024.106530","article-title":"Revised eight-step feasibility checking procedure with linear time complexity for the Dial-a-Ride Problem (DARP)","volume":"164","author":"Sohrabi","year":"2024","journal-title":"Comput. Oper. Res."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/17\/2\/88\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T14:02:21Z","timestamp":1760104941000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/17\/2\/88"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,19]]},"references-count":37,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2024,2]]}},"alternative-id":["a17020088"],"URL":"https:\/\/doi.org\/10.3390\/a17020088","relation":{},"ISSN":["1999-4893"],"issn-type":[{"value":"1999-4893","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,2,19]]}}}