Sourabh

New Proofs of Exact LP Reformulations for Binary Polynomial Optimization with Bounded Treewidth

  • Sourabh
  • Santanu S. Dey
  • Nikolaos Sahinidis
    • Categories Combinatorial Optimization Tags , ,

    In this work, we revisit binary polynomial optimization (BPO) problems with limited treewidth of the associated graph. We provide alternate proofs of the exactness of a reformulated linear program (LP) with O(n.2^d) variables, n being the number of variables and d being the treewidth of the associated graph. The first proof relies on expressing any … Read more

    Water network design and operation optimization: Leveraging approximations

  • Sourabh
  • Santanu S. Dey
  • Nikolaos Sahinidis
    • Categories Network Optimization Tags , ,

    This study concerns the optimal design and operation of produced water and urban water networks. The optimization formulations of these problems have inherent nonconvexity, making them hard to solve. We address a key source of nonconvexity and difficulty in solving these problems: the representation of frictional pressure changes across network nodes using nonlinear constraints, typically … Read more