Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 7 of 7 for “"polyhedral theory"”.
-
SUBMODULAR FUNCTIONS, GRAPHS AND INTEGER POLYHEDRA
… the essential mathematical background in polyhedral theory, linear programming and graph theory. We also discuss the existence of an integer-valued optimum solution to a linear program. This is essential for determining that the vertices of certain polyhedra are integer-valued, and for …
-
Relaxations of the Maximum Flow Minimum Cut Property for Ideal Clutters
Given a family of sets, a covering problem consists of finding a minimum cost collection of elements that hits every set. This objective can always be bound by the maximum number of disjoint sets in the family, we refer to this as the covering dual, since when we allow covers to be fractional and …
-
Integer programming approaches for semicontinuous and stochastic optimization
… programs. We draw tools from complexity and polyhedral theory to analyze these problems and propose improved solution methods. In the first part, we consider semi-continuous network flow problems, that is, a class of network flow problems where some of the variables are required to take …
-
Single-Scenario Facet Preservation for Stochastic Mixed-Integer Programs
We consider improving the polyhedral representation of the extensive form of an SMIP. Given a facet-defining valid inequality for a single-scenario version of the SMIP, we provide conditions under which the same inequality remains facet-defining for the extensive form. Our main result gives …
-
On the convexity of right-closed sets and its application to liveness enforcement in Petri Nets
A set of n-dimensional integral vectors, Nn, is said to be right-closed if for any x 2 , any vector y x also belongs to it. An integral-set Nn is convex if and only if there is a convex set C Rn such that = Int(C), where Int( ) denotes the integral points in the set argument. In this dissertation, …
-
Sensitivity Analysis and Robust Optimization: A Geometric Approach for the Special Case of Linear Optimization
In this thesis, we study the special case of linear optimization to show what may affect the sensitivity of the optimal value function under data uncertainty. In this special case, we show that the robust optimization problem with a locally smaller feasible region yields a more conservative robust …
-
FACES OF MATCHING POLYHEDRA
Let G = (V, E, ~) be a finite loopless graph, let b=(bi:ieV) be a vector of positive integers. A feasible matching is a vector X = (x.: j e: E) J of nonnegative integers such that for each node i of G, the sum of the over the edges j of G incident with i is no greater than bi. The matching …