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

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

2008
ALPER ATAMTÜRK, VISHNU NARAYANAN,

A conic integer program is an integer programming problem with conic constraints. Many problems in finance, engineering, statistical learning, and probabilistic optimization are modeled using conic constraints. Here we study mixed-integer sets defined by second-order conic constraints. We introduce general-purpose cuts for conic mixed-integer programming based on polyhedral conic substructures ...

2010
Andrea Lodi,

The first 50 years of Integer and Mixed-Integer Programming have taken us to a very stable paradigm for solving problems in a reliable and effective way. We run over these 50 exciting years by showing some crucial milestones and we highlight the building blocks that are making nowadays solvers effective from both a performance and an application viewpoint. Finally, we show that a lot of work mu...

2003
Michael R. Bussieck, Armin Pruessner,

Recently, the area of Mixed Integer Nonlinear Programming (MINLP) has experienced tremendous growth and a flourish of research activity. In this article we will give a brief overview of past developments in the MINLP arena and discuss some of the future work that can foster the development of MINLP in general and, in particular, robust solver technology for the practical solution of problems.

M. Toloo, Z. Khoshhal Nakhjiry,

Data Envelopment Analysis (DEA) cannot provide adequate discrimination among efficient decision making units (DMUs). To discriminate these efficient DMUs is an interesting research subject. The purpose of this paper is to develop the mix integer linear model which was proposed by Foroughi (Foroughi A.A. A new mixed integer linear model for selecting the best decision making units in data envelo...

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

Journal: :Foundations and Trends in Robotics 2013
Pramod Abichandani, Hande Y. Benson, Moshe Kam,

Real world Multi-Vehicle Motion Planning (MVMP) problems require the optimization of suitable performance measures under an array of complex and challenging constraints involving kinematics, dynamics, collision avoidance, and communication connectivity. The general MVMP problem is thus formulated as a Mathematical Programming (Optimization) problem. In this monograph, we present a Mathematical ...

Journal: :مهندسی صنایع 0
الیپس مسیحی, استادیار بخش مهندسی صنایع- دانشگاه تر..., دانش¬آموخته کارشناسی ارشد مهندسی صنای...,

in this paper a new method is proposed for path planning of planar manipulators amid obstacles through mathematical programming in a way that the robot’s links avoid collision with obstacles throughout their motion from an initial to a goal configuration. after inputting the workspace geometry, the shortest feasible path for the robot’s end-effector is planned toward its goal position using gen...

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

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