Sciweavers

1477 search results - page 166 / 296
» Random Convex Programs
Sort
View
EOR
2007
72views more  EOR 2007»
13 years 9 months ago
Placing a finite size facility with a center objective on a rectangular plane with barriers
This paper addresses the finite size 1-center placement problem on a rectangular plane in the presence of barriers. Barriers are regions in which both facility location and trave...
Avijit Sarkar, Rajan Batta, Rakesh Nagi
MP
2006
120views more  MP 2006»
13 years 9 months ago
Lot-sizing with production and delivery time windows
We study two different lot-sizing problems with time windows that have been proposed recently. For the case of production time windows, in which each client specific order must be ...
Laurence A. Wolsey
MP
1998
108views more  MP 1998»
13 years 8 months ago
Base polytopes of series-parallel posets: Linear description and optimization
We define the base polytope B(P, g) of a partially ordered set P and a supermodular function g on the ideals ofP as the convex hull of the incidence vectors of all linear extensio...
Rainer Schrader, Andreas S. Schulz, Georg Wambach
MP
2010
135views more  MP 2010»
13 years 7 months ago
An inexact Newton method for nonconvex equality constrained optimization
Abstract We present a matrix-free line search algorithm for large-scale equality constrained optimization that allows for inexact step computations. For sufficiently convex problem...
Richard H. Byrd, Frank E. Curtis, Jorge Nocedal
SIAMJO
2010
108views more  SIAMJO 2010»
13 years 7 months ago
Exposed Faces of Semidefinitely Representable Sets
A linear matrix inequality (LMI) is a condition stating that a symmetric matrix whose entries are affine linear combinations of variables is positive semidefinite. Motivated by th...
Tim Netzer, Daniel Plaumann, Markus Schweighofer