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

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

2008
Simge Küçükyavuz Quentin Louveaux Andrew Miller Gábor Pataki Jean - Philippe Richard Daniel Bienstock Oktay Günlük Jeff Linderoth

2000
Josef Kallrath

In this contribution we apply different approaches to solve four rather different MINLP problems: special extensions to time-indexed formulations of production planning problems, a production planning problem in BASF’s petrochemical division, a site analysis of one of BASF’s bigger sites, and a process design problem. The first problem is related to a useful nonlinear extension of production pl...

Mirmajlesi, S. R., Salehi, M.,

In this paper, mathematical models are proposed for simultaneously modeling location and inventory control decisions in a four echelon supply chain network considering capacity. The echelons considered in this paper include suppliers, warehouses, hubs and retailers. The aim of the model is to minimize the location, transportation and inventory control costs. Hence, a non-linear mixed integer pr...

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...

ستایشنظر, مهرداد, نظام‌آبادی, حسین,

This paper addresses the bidding problem faced by a virtual power plant (VPP) in energy, spinning reserve service, and reactive power service market simultaneously. Therefore, a non-equilibrium model based on security constraints price-based unit commitment (SCPBUC), which is take into account the supply-demand balancing and security constraints of VPP, is proposed. By the presented model, VPP ...

Journal: :Discrete & Computational Geometry 2000
Leonid Khachiyan Lorant Porkolab

Let Y be a convex set inRk defined by polynomial inequalities and equations of degree at most d ≥ 2 with integer coefficients of binary length at most l. We show that if the set of optimal solutions of the integer programming problem min{yk | y = (y1, . . . , yk) ∈ Y ∩Zk} is not empty, then the problem has an optimal solution y∗ ∈ Y ∩Zk of binary length ld O(k ). For fixed k, our bound implies ...

Journal: :Journal of Combinatorial Optimization 2023

Abstract The paper considers the assignment of items to groups according their attribute values such that are as balanced possible. Although problem is in general NP -hard, we prove it can be solved pseudo-polynomial time if integer. We point out a relation partition and more multi-way number partitioning. Furthermore, introduce mixed-integer programming (MIP) formulation, variable reduction te...

Journal: :CoRR 2009
Shmuel Onn

We overview our recently introduced theory of n-fold integer programming which enables the polynomial time solution of fundamental linear and nonlinear integer programming problems in variable dimension. We demonstrate its power by obtaining the first polynomial time algorithms in several application areas including multicommodity flows and privacy in statistical databases.

Journal: :journal of optimization in industrial engineering 0
arghavan sharafi department of industrial engineering, faculty of engineering shahed university, tehran, iran mahdi bashiri ie department, shahed university, qom highway, tehran

over the two last decades, distribution companies have been aware of the importance of paying attention to the all aspects of a distribution system simultaneously to be successful in the global market. these aspects are the economic, the environmental, the social and the safety aspects. in the vehicle routing problem (vrp) literature, the economic issue has often been used, while the environmen...

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

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