Manish Bansal

Facets for Continuous Multi-Mixing Set with General Coefficients and Bounded Integer Variables

  • Manish Bansal
  • Kiavash Kianfar
    • Categories (Mixed) Integer Linear Programming, Cutting Plane Approaches, Integer Programming Tags , , , , ,

    Bansal and Kianfar introduced continuous multi-mixing set where the coefficients satisfy the so-called n-step MIR conditions and developed facet-defining inequalities for this set. In this paper, we first generalize their inequalities for the continuous multi-mixing set with general coefficients (where no conditions are imposed on the coefficients) and show that they are facet-defining in many … Read more

    Planar Maximum Coverage Location Problem with Partial Coverage and Rectangular Demand and Service Zones

  • Manish Bansal
  • Kiavash Kianfar
    • Categories Combinatorial Optimization

    We study the planar maximum coverage location problem (MCLP) with rectilinear distance and rectangular demand zones in the case where “partial coverage” is allowed in its true sense, i.e., when covering only part of a demand zone is allowed and the coverage accrued as a result of this is proportional to the demand of the … Read more

    n-step cycle inequalities: facets for continuous n-mixing set and strong cuts for multi-module capacitated lot-sizing problem

  • Manish Bansal
  • Kiavash Kianfar
    • Categories (Mixed) Integer Linear Programming, Cutting Plane Approaches, Production and Logistics Tags , , , , ,

    In this paper, we introduce a generalization of the continuous mixing set (which we refer to as the continuous n-mixing set). This set is closely related to the feasible set of the multi-module capacitated lot-sizing (MML) problem with(out) backlogging. We develop new classes of valid inequalities for this set, referred to as n’-step cycle inequalities, … Read more

    Robust Decision Making using a General Utility Set

  • Manish Bansal
  • Jian Hu
  • Sanjay Mehrotra
    • Categories Finance and Economics, Robust Optimization, Stochastic Programming Tags , , ,

    We develop the concept of utility robustness to address the problem of ambiguity and inconsistency in utility assessments. A robust decision-making framework is built on a utility set which characterizes a decision maker’s risk attitude described by boundary and auxiliary conditions. This framework is studied using the Sample Average Approximation (SAA) approach. We show the … Read more