Using the NEOS Server for Solving Two Classes of Optimization Problems

Halyna Bila, Oleksandr Korchynskyy, P. Stetsyuk, O. Khomiak, Serhiy Shekhovtsov
{"title":"Using the NEOS Server for Solving Two Classes of Optimization Problems","authors":"Halyna Bila, Oleksandr Korchynskyy, P. Stetsyuk, O. Khomiak, Serhiy Shekhovtsov","doi":"10.34229/2707-451x.22.4.5","DOIUrl":null,"url":null,"abstract":"NEOS server provides free access to the library of necessary software for solving optimization problems. The effective numerical methods developed can be used for a specific application or for solving a wide range of mathematical programming problems.\nThe article is devoted to researching the possibilities of solving optimization problems using NEOS server on the example of two mathematical programming problems: a linear Boolean programming problem for the well-known m-traveler problem and nonlinear programming problem for a special multiextremal problem on the Stiefel’s manifold.\nThe material of the work is presented in 4 sections. Chapter 1 describes general information about using NEOS server for solving optimization problems and focuses on AMPL mathematical programming language as its component. Comparison of the frequency of use of AMPL, GAMS and other input data formats available on the server was conducted.\nThe second section describes the principle of solving optimization problems using NEOS and provides a list of AMPL-supporting solvers available on the server. Statistics of use frequency of the solvers CPLEX, Gurobi and BARON in comparison with other solvers available on the server, as well as general statistics of the number of solved problems on the server in 2021 are given.\nChapter 3 describes linear Boolean programming problems for the m-travelers problem, which is equivalent to the well-known traveling salesman problem. Performance indicators for solving these problems using CPLEX and Gurobi solvers are given.\nIn Chapter 4 a study of nonlinear programming problem for a special multiextremal problem on the Stiefel’s manifold is conducted. General formulation of the problem and the formulation of its partial cases depending on the constraints imposed on vector components are given. The efficiency of solving test cases using BARON solver was investigated depending on the number of vectors and their dimensions. Keywords: optimization, NEOS server, AMPL, NEOS solvers, travelling salesman problem, Stiefel’s manifold.","PeriodicalId":34598,"journal":{"name":"Kibernetika ta kompiuterni tekhnologiyi","volume":" ","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2022-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Kibernetika ta kompiuterni tekhnologiyi","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.34229/2707-451x.22.4.5","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

NEOS server provides free access to the library of necessary software for solving optimization problems. The effective numerical methods developed can be used for a specific application or for solving a wide range of mathematical programming problems. The article is devoted to researching the possibilities of solving optimization problems using NEOS server on the example of two mathematical programming problems: a linear Boolean programming problem for the well-known m-traveler problem and nonlinear programming problem for a special multiextremal problem on the Stiefel’s manifold. The material of the work is presented in 4 sections. Chapter 1 describes general information about using NEOS server for solving optimization problems and focuses on AMPL mathematical programming language as its component. Comparison of the frequency of use of AMPL, GAMS and other input data formats available on the server was conducted. The second section describes the principle of solving optimization problems using NEOS and provides a list of AMPL-supporting solvers available on the server. Statistics of use frequency of the solvers CPLEX, Gurobi and BARON in comparison with other solvers available on the server, as well as general statistics of the number of solved problems on the server in 2021 are given. Chapter 3 describes linear Boolean programming problems for the m-travelers problem, which is equivalent to the well-known traveling salesman problem. Performance indicators for solving these problems using CPLEX and Gurobi solvers are given. In Chapter 4 a study of nonlinear programming problem for a special multiextremal problem on the Stiefel’s manifold is conducted. General formulation of the problem and the formulation of its partial cases depending on the constraints imposed on vector components are given. The efficiency of solving test cases using BARON solver was investigated depending on the number of vectors and their dimensions. Keywords: optimization, NEOS server, AMPL, NEOS solvers, travelling salesman problem, Stiefel’s manifold.
利用NEOS服务器求解两类优化问题
NEOS服务器提供了对解决优化问题所需软件库的免费访问。所开发的有效数值方法可用于特定应用或解决广泛的数学规划问题。本文以两个数学规划问题为例,研究了利用NEOS服务器求解优化问题的可能性:著名m-traveler问题的线性布尔规划问题和Stiefel流形上一个特殊多极问题的非线性规划问题。这项工作的材料分为四个部分。第一章介绍了使用NEOS服务器解决优化问题的一般信息,并重点介绍了作为其组件的AMPL数学编程语言。对服务器上可用的AMPL、GAMS和其他输入数据格式的使用频率进行了比较。第二部分描述了使用NEOS解决优化问题的原理,并提供了服务器上可用的支持AMPL的解决程序列表。统计了CPLEX、Gurobi和BARON解决方案与服务器上其他解决方案的使用频率,以及2021年服务器上解决问题数量的总体统计数据。第3章描述了m-walkers问题的线性布尔规划问题,该问题等价于著名的旅行商问题。给出了使用CPLEX和Gurobi解算器解决这些问题的性能指标。第四章研究了Stiefel流形上一个特殊的多极值问题的非线性规划问题。给出了该问题的一般公式和取决于向量分量约束的部分情况的公式。研究了使用BARON求解器求解测试用例的效率,这取决于向量的数量及其维度。关键词:优化,NEOS服务器,AMPL,NEOS求解器,旅行推销员问题,Stiefel流形。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
20
审稿时长
6 weeks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书