A procedure is developed to solve a concave decomposable system. The general structure is treated in the same way as the classical Dantzig-Wolfe decomposition and Benders' partitioning procedures. Nonlinearities are permitted ...

The problem we consider is the approximation of m elements (xₗ,...,xₘ) in a normed linear space by one element in a subset of that normed linear space. To each element in the ordered m-tuple (xₗ,...,xₘ) we associate ...

The nonlinear programming problem P: maximize f(x) subject to g(x) nonnegative, is considered where f and g are continuously differentiable functions defined on Euclidean n-space, and g is vector-valued. Convergence theorems ...

Finally, we consider the problem of modifying the algorithm for listing efficient extreme points to identify the extreme points contained in each maximal efficient face. As each efficient extreme point- is considered, an ...

We consider problems in network mitigation and restoration motivated by disruptive events like natural disasters that impact infrastructure and supply chain networks. The problems we consider include developing a procedure ...