نتایج جستجو برای: mixed integer non
تعداد نتایج: 1546524 فیلتر نتایج به سال:
This study addresses a stochastic structure for generation companies (GenCoʼs) that participate in hydro-thermal self-scheduling with a wind power plant on short-term scheduling for simultaneous reserve energy and energy market. In stochastic scheduling of HTSS with a wind power plant, in addition to various types of uncertainties such as energy price, spinning /non-spinning reserve prices, unc...
We study the complexity of computing the mixed-integer hull conv(P ∩ Z ×R) of a polyhedron P . Given an inequality description, with one integer variable, the mixed-integer hull can have exponentially many vertices and facets in d. For n, d fixed, we give an algorithm to find the mixed integer hull in polynomial time. Given P = conv(V ) and n fixed, we compute a vertex description of the mixed-...
In a number of situations the derivative of the objective function of an optimization problem is not available. This thesis presents a novel algorithm for solving mixed integer programs when this is the case. The algorithm is the first developed for problems of this type which uses a trust region methodology. Three implementations of the algorithm are developed and deterministic proofs of conve...
Branch-and-Bound (B&B) is perhaps the most fundamental algorithm for the global solution of convex Mixed-Integer Nonlinear Programming (MINLP) problems. It is well-known that carrying out branching in a non-simplistic manner can greatly enhance the practicality of B&B in the context of Mixed-Integer Linear Programming (MILP). No detailed study of branching has heretofore been carried out for MI...
Mixed-integer rounding (MIR) inequalities play a central role in the development of strong cutting planes for mixed-integer programs. In this paper, we investigate how known MIR inequalities can be combined in order to generate new strong valid inequalities. Given a mixed-integer region S and a collection of valid \base" mixed-integer inequalities , we develop a procedure for generating new val...
NK landscapes (NKL) are stochastically generated pseudoboolean functions with N bits (genes) and K interactions between genes. By means of the parameter K ruggedness as well as the epistasis can be controlled. NKL are particularly useful to understand the dynamics of evolutionary search. We extend NKL from the traditional binary case to a mixed variable case with continuous, nominal discrete, a...
We consider the question of which nonconvex sets can be represented exactly as the feasible sets of mixed-integer convex optimization problems. We state the first complete characterization for the case when the number of possible integer assignments is finite. We develop a characterization for the more general case of unbounded integer variables together with a simple necessary condition for re...
Many optimal decision problems in scientific, engineering, and public sector applications involve both discrete decisions and nonlinear system dynamics that affect the quality of the final design or plan. These decision problems lead to mixed-integer nonlinear programming (MINLP) problems that combine the combinatorial difficulty of optimizing over discrete variable sets with the challenges of ...
We present a scheme for generating new valid inequalities for mixed integer programs by taking pairwise combinations of existing valid inequalities. Our scheme is related to mixed integer rounding and mixing. The scheme is in general sequence-dependent and therefore leads to an exponential number of inequalities. For some important cases, we identify combination sequences that lead to a managea...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید