نتایج جستجو برای: mixed integer non linear programming minlp

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

Journal: :Operations Research 2011
Antonio Frangioni Claudio Gentile Enrico Grande Andrea Pacifici

The Perspective Relaxation (PR) is a general approach for constructing tight approximations to MixedInteger 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 SOCPrepresentable), or as a Semi-Infinite MINLP. In this paper, we show that under some further assum...

Journal: :Discrete Optimization 2007

Journal: :Energies 2021

Due to the rapid increase in electric vehicles (EVs) globally, new technologies have emerged recent years meet excess demand imposed on power systems by EV charging. Among these technologies, a mobile energy storage system (MESS), which is transportable that provides various utility services, was used this study support several charging stations, addition supplying grid during overload and on-p...

Journal: :Journal of Communications and Networks 2023

Integrated access and backhaul (IAB) network is envisioned as a novel architecture for increasing the capacity coverage. To facilitate IAB network, appropriate methods of wireless link association resource management are required. In this paper, we investigate joint optimization problem allocation in terms subchannel power network. particular, handle problems links considering multi-hop backhau...

Journal: :Computers & OR 2007
Kris Lieckens Nico Vandaele

This work is concerned with the efficient design of a reverse logistics network using an extended version of models currently found in the literature. Those traditional, basic models are formulated as mixed integer linear programs (MILP-model) and determine which facilities to open that minimize the investment, processing, transportation, disposal and penalty costs while supply, demand and capa...

Atousa Zarindast Mir Saman Pishvaee Seyed Mohamad Seyed Hosseini

Robust supplier selection problem, in a scenario-based approach has been proposed, when the demand and exchange rates are subject to uncertainties. First, a deterministic multi-objective mixed integer linear programming is developed; then, the robust counterpart of the proposed mixed integer linear programming is presented using the recent extension in robust optimization theory. We discuss dec...

Journal: :SIAM Journal on Optimization 2011
Andres Guerra Alexandra M. Newman Sven Leyffer

We present a mixed-integer nonlinear programming (MINLP) formulation to achieve minimum-cost designs for reinforced concrete (RC) structures that satisfy building code requirements. The objective function includes material and labor costs for concrete, steel reinforcing bars, and formwork according to typical contractor methods. Restrictions enforce correct geometry of the cross-section dimensi...

2013
Ambros M. Gleixner Stefan Weltge

Optimization-based bound tightening (OBBT) is a domain reduction technique commonly used in nonconvex mixed-integer nonlinear programming that solves a sequence of auxiliary linear programs. Each variable is minimized and maximized to obtain the tightest bounds valid for a global linear relaxation. This paper shows how the dual solutions of the auxiliary linear programs can be used to learn wha...

Journal: :J. Global Optimization 2009
Steffen Rebennack Josef Kallrath Panos M. Pardalos

We propose a decomposition algorithm for a special class of nonconvex mixed integer nonlinear programming problems which have an assignment constraint. If the assignment decisions are decoupled from the remaining constraints of the optimization problem, we propose to use a column enumeration approach. The master problem is a partitioning problem whose objective function coefficients are compute...

Journal: :IEEE/ACM Transactions on Computational Biology and Bioinformatics 2008

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

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