نتایج جستجو برای: mixed integer nonlinear programming
تعداد نتایج: 770161 فیلتر نتایج به سال:
Spectrum sharing with quality of service (QoS) requirement and power constraint on cognitive users is studied. The objective is to maximize the system throughput. This problem is modeled as a mixed integer nonlinear programming problem and then transformed to a continuous nonlinear programming problem through eliminating integer variables. We propose the joint power control and spectrum allocat...
We study the generalization of split and intersection cuts from Mixed Integer Linear Programming to the realm of Mixed Integer Nonlinear Programming. Constructing such cuts requires calculating the convex hull of the difference of two convex sets with specific geometric structures. We introduce two techniques to give precise characterizations of such convex hulls and use them to construct split...
The lift-gas allocation problem with pressure-drop constraints and well-separator routing is a mixed-integer nonlinear program considerably hard to solve. To this end, a mixed-integer linear programming formulation was developed by multidimensional piecewiselinearization of pressure drop functions using standard (CC) and logarithmic (Log) aggregated models. These models were compared by means o...
of Dissertation Presented to the Graduate School of the University of Florida in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy STRONG VALID INEQUALITIES FOR MIXED-INTEGER NONLINEAR PROGRAMS VIA DISJUNCTIVE PROGRAMMING AND LIFTING By Kwanghun Chung August 2010 Chair: Jean-Philippe. P. Richard Major: Industrial and Systems Engineering Mixed-Integer Nonlinear Progr...
In this work, we present a new hybrid algorithm for convex Mixed Integer Nonlinear Programming combining branch-and-bound and outer approximation algorithms in an e ective and e cient way.
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 ...
In this article we investigate methods to solve a fundamental task in gas transportation, namely the validation of nomination problem: Given a gas transmission network consisting of passive pipelines and active, controllable elements and given an amount of gas at every entry and exit point of the network, find operational settings for all active elements such that there exists a network state m...
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...
Mixed-integer conic programming is a generalization of mixed-integer linear programming. In this paper, we present an extension of the duality theory for mixed-integer linear programming (see [4], [11]) to the case of mixed-integer conic programming. In particular, we construct a subadditive dual for mixed-integer conic programming problems. Under a simple condition on the primal problem, we ar...
This paper develops an MILP model, named Satisfactory-Green Vehicle Routing Problem. It consists of routing a heterogeneous fleet of vehicles in order to serve a set of customers within predefined time windows. In this model in addition to the traditional objective of the VRP, both the pollution and customers’ satisfaction have been taken into account. Meanwhile, the introduced model prepares a...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید