Learn More
The plant cell wall is an important factor for determining cell shape, function and response to the environment. Secondary cell walls, such as those found in xylem, are composed of cellulose, hemicelluloses and lignin and account for the bulk of plant biomass. The coordination between transcriptional regulation of synthesis for each polymer is complex and(More)
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use. The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. Abstract. We study a variant of the pessimistic bilevel optimization problem,(More)
We study the solution of non-convex, pessimistic bi-level problems. After providing several motivating examples, we relate the problem to existing research in optimisation. We analyse key properties of the optimisation problem, such as closedness of the feasible region and computational complexity. We then present and investigate a semi-infinite solution(More)
The algorithm proposed in [Mitsos Optimization 2011] for the global optimization of semi-infinite programs is extended to the global optimization of generalized semi-infinite programs (GSIP). No convexity or concavity assumptions are made. The algorithm employs convergent lower and upper bounds which are based on regular (in general nonconvex) nonlinear(More)
The Feasibility Pump (FP) has proved to be an effective method for finding feasible solutions to mixed integer programming problems. FP iterates between a rounding procedure and a projection procedure , which together provide a sequence of points alternating between LP relaxation feasible but fractional solutions, and integer but LP relaxation infeasible(More)
McCormick (Math Prog 10(1):147–175, 1976) provides the framework for convex/concave relaxations of factorable functions, via rules for the product of functions and compositions of the form F◦ f , where F is a univariate function. Herein, the composition theorem is generalized to allowmultivariate outer functions F , and theory for the propagation of(More)
The feasibility pump is a recent, highly successful heuristic for general mixed integer linear programming problems. We show that the feasibility pump heuristic can be interpreted as a discrete version of the proximal point algorithm. In doing so, we extend and generalize some of the fundamental results in this area to provide new supporting theory. We show(More)