We give a new, flow-type convex program describing equilibrium solutions to linear Arrow-Debreu markets. Whereas convex formulations were previously known ([17, 15, 6]), our program exhibits several ...

In this paper we shed new light on convex programs and distributed algorithms for Fisher markets with linear and spending constraint utilities. We give a new convex program for the linear utilities ...

Operation of water distribution systems (WDSs) to reduction of water leakage can be achieved by properly operating variable speed pumps (VSPs). This practical problem can be casted into a nonlinear ...

This paper deals with the sampled scenarios approach to robust convex programming. It has been shown in previous works that by randomly sampling a sufficient number of constraints among the (possibly) ...

Using the Graham algorithm, the vertices of a convex polygon will be found. To do this, click on the "build shell" button. Graham 's algorithm: After that, the sides of the resulting polygon are drawn ...

1 can yield a convex minimization objective, convex relaxation techniques consist of replacing P with a larger convex set, resulting in a tractable convex program. Various techniques differ mainly in ...

This program implements a divide-and-conquer algorithm to find the convex hull around a set of points. ##Background. The convex hull of a set Q of points is the smallest convex polygon P for which ...