Nonlinear Integer Programming and Discrete Optimization

Author:

Gupta Omprakash K.1,Ravindran A.2

Affiliation:

1. Indian Inst. of Management, Ahmedabad 15, India

2. School of Industrial Engineering, University of Oklahoma, Norman, Okla. 73019

Abstract

Branch and bound has been widely recognized as an effective method in solving linear integer programming problems. This paper presents a study on the feasibility of the branch and bound method in solving general nonlinear mixed integer programming and discrete optimization problems. First, a description of the branch and bound method as applied to the integer case is given. Next, a computer code BBNLMIP is developed to carry out an experimental study on 22 test problems. The numerical results indicate the effect of the problem parameters such as number of integer variables and constraints. Finally, a method for extending the branch and bound principle to solve nonlinear discrete optimization problems is described.

Publisher

ASME International

Subject

General Engineering

Cited by 26 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Cutting Plane Algorithms are Exact for Euclidean Max-Sum Problems;2023

2. The global optimization method with selective averaging of the discrete decision variables;Vestnik Tomskogo gosudarstvennogo universiteta. Upravlenie, vychislitel'naya tekhnika i informatika;2020-02-01

3. COMPACT HIGH INTENSITY COOLER DESIGN: A GENETIC ALGORITHM OPTIMIZATION TECHNIQUE;Journal of Enhanced Heat Transfer;2017

4. A Non-Uniform Convergence Tolerance Scheme for Enhancing the Branch-and-Bound Method;Transactions of the Korean Society of Mechanical Engineers A;2012-04-01

5. Optimal catalogue selection and custom design of belleville spring arrangements;International Journal on Interactive Design and Manufacturing (IJIDeM);2009-12-18

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3