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

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

Journal: :Annals OR 1997
Etienne de Klerk Kees Roos Tamás Terlaky T. Illés A. J. de Jong J. Valkó J. E. Hoogenboom

The loading pattern of fuel bundles in a reactor core determines the characteristics of the reloading cycle. The problem of maximizing fuel utilization during a cycle may be formulated as a nonlinear mixed integer programming (NLMIP) problem, and has until now mostly been treated by heuristic optimization methods like simulated annealing. This paper evalutes the performance of state-of-the-art ...

Journal: :IEEE Transactions on Systems, Man, and Cybernetics: Systems 2015

Journal: :Comp. Opt. and Appl. 2006
Claus Still Tapio Westerlund

In this article we look at a new algorithm for solving convex mixed integer nonlinear programming problems. The algorithm uses an integrated approach, where a branch and bound strategy is mixed with solving nonlinear programming problems at each node of the tree. The nonlinear programming problems, at each node, are not solved to optimality, rather one iteration step is taken at each node and t...

Journal: :IOP conference series 2021

This paper is about a computer application for planning maintenance of aircraft fleet in what regards allocation skilled technicians. The formalization this mathematical programming problem written as minimizing one. decision variables are the data number available technicians, working hours needed to accomplish maintenance, costs due daily operation facilities, and downtime. Although, non-line...

Journal: :J. Global Optimization 2013
M. Li Luís Nunes Vicente

In the context of convex mixed integer nonlinear programming (MINLP), we investigate how the outer approximation method and the generalized Benders decomposition method are affected when the respective nonlinear programming (NLP) subproblems are solved inexactly. We show that the cuts in the corresponding master problems can be changed to incorporate the inexact residuals, still rendering equiv...

Feizollahi, Modarres yazdi,

 We consider a generalization of the classical quadratic assignment problem, where coordinates of locations are uncertain and only upper and lower bounds are known for each coordinate. We develop a mixed integer linear programming model as a robust counterpart of the proposed uncertain model. A key challenge is that, since the uncertain model involves nonlinear objective function of the ...

2004
Lorenz T. Biegler Ignacio E. Grossmann

Optimization as an enabling technology has been one of the big success stories in process systems engineering. In this paper we present first a general review of optimization and its applications to a variety of problems in process systems engineering. Next, we provide an overview of two key areas: nonlinear programming and logic-based discrete/continuous optimization. In particular, recent adv...

Journal: :Optimization Letters 2007
Oliver Exler Klaus Schittkowski

We propose a modified sequential quadratic programming (SQP) method for solving mixed-integer nonlinear programming problems. Under the assumption that integer variables have a smooth influence on the model functions, i.e., that function values do not change drastically when inor decrementing an integer value, successive quadratic approximations are applied. The algorithm is stabilized by a tru...

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

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