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

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

2006
Michael Russell

The purpose of this paper is to present an overview of families of cutting planes for mixed integer programming problems. We examine the families of disjunctive inequalities, split cuts, mixed integer rounding inequalities, mixed integer Gomory cuts, intersection cuts, lift-and-project cuts, and reduceand-split cuts. In practice, mixed integer Gomory cuts are very useful in obtaining solutions ...

Journal: :Math. Program. 2017
Alberto Del Pia Santanu S. Dey Marco Molinaro

Mixed-integer quadratic programming (MIQP) is the problem of optimizing a quadratic function over points in a polyhedral set where some of the components are restricted to be integral. In this paper, we prove that the decision version of mixed-integer quadratic programming is in NP, thereby showing that it is NP-complete. This is established by showing that if the decision version of mixed-inte...

2012
Guohua Liu Tomi Janhunen Ilkka Niemelä

Answer set programming is a programming paradigm where a given problem is formalized as a logic program whose answer sets correspond to the solutions to the problem. In this paper, we link answer set programming with another widely applied paradigm, viz. mixed integer programming. As a theoretical result, we establish translations from non-disjunctive logic programs to linear constraints used i...

2004
Konstantinos Kostikas Charalambos Fragakis

We present the application of Genetic Programming (GP) in Branch and Bound (B&B) based Mixed Integer Linear Programming (MIP). The hybrid architecture introduced employs GP as a node selection expression generator: a GP run, embedded into the B&B process, exploits the characteristics of the particular MIP problem being solved, evolving a problem-specific node selection method. The evolved metho...

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: :Jurnal Pendidikan Kedokteran Indonesia: The Indonesian Journal of Medical Education 2016

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

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