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

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

Journal: :Mathematics in applied sciences and engineering 2023

Water is a basic part of our daily lives, as such effective water supply paramount importance. Thus, result the rise in population size and shortage there need for proper, suitable optimal utilization resources to efficiently be distributed among populace. The proper allocation distribution field network planning modelled through mathematical parameters objective system. This approach requires ...

Journal: :Rairo-operations Research 2021

We present a Mixed Integer Linear Programming (MILP) approach in order to model the non-linear problem of minimizing tire noise function. In recent work, we proposed an exact solution for Tire Noise Optimization Problem, dealing with APproximation (TNOP-AP). Here study original modeling EXact- or real-noise (TNOP-EX) and propose new scheme obtain TNOP-EX. Relying on TNOP-AP, use Branch&Cut ...

Journal: :Mathematics 2021

The mean-variance (MV) portfolio is typically formulated as a quadratic programming (QP) problem that linearly combines the conflicting objectives of minimizing risk and maximizing expected return through aversion profile parameter. In this formulation, two are expressed in different units, an issue could definitely hamper obtaining more competitive set weights. For example, modification scale ...

Journal: :Frontiers in Energy Research 2023

Developing a minimum backbone grid in the power system planning is beneficial to improve system’s resilience. To obtain grid, mixed integer linear programming (MILP) model with network connectivity constraints for proposed. In model, some are presented consider practical application requirements. Especially, avoid islands set of based on single-commodity flow formulations proposed ensure grid. ...

2016
Alberto Del Pia

Concave Mixed-Integer Quadratic Programming is the problem of minimizing a concave quadratic polynomial over the mixed-integer points in a polyhedral region. In this work we describe two algorithms that find an -approximate solution to a Concave Mixed-Integer Quadratic Programming problem. The running time of the proposed algorithms is polynomial in the size of the problem and in 1/ , provided ...

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

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