نتایج جستجو برای: minlp approach

تعداد نتایج: 1290414  

Journal: :Computational Optimization and Applications 2021

Abstract We consider a nonconvex mixed-integer nonlinear programming (MINLP) model proposed by Goldberg et al. (Comput Optim Appl 58:523–541, 2014. 10.1007/s10589-014-9647-y ) for piecewise linear function fitting. show that this MINLP is incomplete and can result in curve not the graph of function, because it misses set necessary constraints. provide two counterexamples to illustrate effect, p...

2013
JESCO HUMPOLA ARMIN FÜGENSCHUH THOMAS LEHMANN Jesco Humpola Armin Fügenschuh Thomas Lehmann

We present a novel heuristic algorithm to identify feasible solutions of a mixed-integer nonlinear programming problem arising in natural gas transportation: the selection of new pipelines to enhance the network’s capacity to a desired level in a cost-efficient way. We solve this problem in a linear programming based branch-and-cut approach, where we deal with the nonlinearities by linear outer...

Journal: :INFORMS Journal on Computing 2015
Francisco Trespalacios Ignacio E. Grossmann

In this work, we propose an algorithmic approach to improve mixed-integer models that are originally formulated as convex Generalized Disjunctive Programs (GDP). The algorithm seeks to obtain an improved continuous relaxation of the MILP/MINLP reformulation of the GDP, while limiting the growth in the problem size. There are three main stages that form the basis of the algorithm. The first one ...

Journal: :Computers & OR 2012
Lixin Tang Ping Che Jiyin Liu

Most production planning models are deterministic and often assume a linear relation between production volume and production cost. In this paper, we investigate a production planning problem in a steel production process considering the energy consumption cost which is a nonlinear function of the production quantity. Due to the uncertain environment, the production demands are stochastic. Taki...

2002
G. Gutierrez P. Vega Pedro Ballesteros

Process Synthesis seeks to develop systematically process flowsheets that convert raw materials into desired products. In recent years, the optimization approach to process synthesis has shown promise in tackling this challenge. It requires the development of a network of interconnected units, the process superstructure, that represents the alternative process flowsheets. The mathematical model...

2004
Jing Wei Matthew J. Realff

This paper is an application of the systematic design approach to the plastics separation systems synthesis under uncertainty. The problem is distinguished from the traditional chemical distillation processes in that, first there are many separation mechanisms can be used and a combination of them is a necessity and second there is a significant variation of feed composition leading to the desi...

2008
Sylvain Mouret Ignacio E. Grossmann Pierre Pestiaux

The optimal scheduling of crude-oil operations in refineries has been studied by various groups during the past decade leading to different mixed integer linear programming (MILP) or mixed integer nonlinear programming (MINLP) formulations. This paper presents a new continuous-time formulation, called single-operation sequencing (SOS) model, which can be used to solve the crude-oil operations p...

Journal: :J. Optimization Theory and Applications 2011
Luís M. Fernandes Joaquim Júdice Hanif D. Sherali António Pais Antunes

In this paper a discrete location model for non-essential service facilities planning is described, which seeks the number, location, and size of facilities, that maximizes the total expected demand attracted by the facilities. It is assumed that the demand for service is sensitive to the distance from facilities and to their size. It is also assumed that facilities must satisfy a threshold lev...

2008
Soomin Lee Benjamin W. Wah

In this paper, we develop heuristics for finding good starting points when solving large-scale nonlinear constrained optimization problems (COPs) formulated as nonlinear programming (NLP) and mixedinteger NLP (MINLP). By exploiting the localities of constraints, we first partition each problem by parallel decomposition into subproblems that are related by complicating constraints and complicati...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید