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

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

2007
Miloš Bogataj Miguel J. Bagajewicz

Despite the fact that many methods have been developed for the optimization of process water networks, solving the problem simultaneously considering heat recovery has rarely been addressed. This paper presents a new approach for the simultaneous synthesis and optimization of heat integrated water networks. The procedure is based on mixed integer non-linear mathematical programming (MINLP). A n...

2009
Antonio Frangioni Claudio Gentile Enrico Grande Andrea Pacifici

The Perspective Relaxation (PR) is a general approach for constructing tight approximations to Mixed-Integer NonLinear Problems with semicontinuous variables. The PR of a MINLP can be formulated either as a Mixed-Integer Second-Order Cone Program (provided that the original objective function is SOCP-representable), or as a Semi-Infinite MINLP. While these reformulations significantly improve t...

Journal: :Revista Ingenieria E Investigacion 2021

This paper deals with the problem of optimal reconfiguration medium voltage distribution networks by proposing a mixed-integer nonlinear programming (MINLP) model. optimization model has as objective function minimization total power losses in all branches network constrained active and reactive balance equations, regulation bounds device capabilities, among others. The proposed MINLP formulati...

Journal: :Journal of Global Optimization 2022

Abstract In this paper, an open-source solver for mixed-integer nonlinear programming (MINLP) problems is presented. The Supporting Hyperplane Optimization Toolkit (SHOT) combines a dual strategy based on polyhedral outer approximations (POA) with primal heuristics. POA achieved by expressing the feasible set of MINLP problem linearizations obtained extended supporting hyperplane (ESH) and cutt...

Journal: :Optimization Methods and Software 2011
Hande Y. Benson

In this paper, we outline a bilevel approach for solving mixed integer nonlinear programming problems. The approach combines a branch-and-bound algorithm in the outer iterations and an infeasible interior-point method in the inner iterations. We report on the details of the implementation, including the efficient pruning of the branch-and-bound tree via equilibrium constraints, warmstart strate...

Journal: :Computers & Chemical Engineering 2008
José María Ponce-Ortega Arturo Jiménez-Gutiérrez Ignacio E. Grossmann

This paper proposes a new MINLP model for heat exchanger network synthesis that includes streams with phase change. The model considers every possible combination of process streams that may arise within a chemical process: streams with sensible heat, streams with latent heat, and streams with both latent and sensible heat. As part of the optimization strategy, the superstructure is modeled wit...

2012
Hossein Nourkhiz Mahjoub Mohsen Shiva

Wireless Mesh Networking is a promising proposal for broadband data transmission in a large area with low cost and acceptable QoS. These features’ trade offs in WMNs is a hot research field nowadays. In this paper a mathematical optimization framework has been developed to maximize throughput according to upper bound delay constraints. IEEE 802.11 based infrastructure backhauling mode of WMNs h...

2008
Naresh N. Nandola Sharad Bhartiya

This paper presents an efficient optimization algorithm for mixed integer nonlinear programming (MINLP) problem resulting from multiple partially linearized (MPL) model based control of nonlinear hybrid dynamical system (NHDS). The algorithm uses structural information of the canonical MPL framework and derives comparatively easier quadratic programming (QP) primal problem as well as an MILP ma...

2010
Michael R. Bussieck Stefan Vigerske

In this article we will give a brief overview of the start-of-the-art on software for the solution of mixed integer nonlinear programs (MINLP). We establish several groupings with respect to various features and give concise individual descriptions for each solver.

Journal: :Comp. Opt. and Appl. 2016
Marcia Fampa Jon Lee Wendel Melo

We present a specialized branch-and-bound (b&b) algorithm for the Euclidean Steiner tree problem (ESTP) in R and apply it to a convex mixed-integer nonlinear programming (MINLP) formulation of the problem, presented by Fampa and Maculan. The algorithm contains procedures to avoid difficulties observed when applying a b&b algorithm for general MINLP problems to solve the ESTP. Our main emphasis ...

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

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