Mehrotra Sanjay

Sanjay Mehrotra

Information about the author Sanjay Mehrotra will soon be added to the site.
Found 16 papers in total
Batch Sample Design from Databases for Logistic Regression
Batch Sample Design from Databases for Logistic Regression
2017
The prevalence of large observational databases offers potential for identifying...
A Two-Stage Stochastic Integer Programming Approach to Integrated Staffing and Scheduling with Application to Nurse Management
A Two-Stage Stochastic Integer Programming Approach to Integrated Staffing and Scheduling with Application to Nurse Management
2015
We study the problem of integrated staffing and scheduling under demand uncertainty....
Solution of Monotone Complementarity and General Convex Programming Problems Using a Modified Potential Reduction Interior Point Method
Solution of Monotone Complementarity and General Convex Programming Problems Using a Modified Potential Reduction Interior Point Method
2017
We present a homogeneous algorithm equipped with a modified potential function for the...
An empirical evaluation of walk‐and‐round heuristics for mixed integer linear programs
An empirical evaluation of walk‐and‐round heuristics for mixed integer linear programs
2013
Feasibility pump is a general purpose technique for finding feasible solutions of...
Outcome based state budget allocation for diabetes prevention programs using multi‐criteria optimization with robust weights
Outcome based state budget allocation for diabetes prevention programs using multi‐criteria optimization with robust weights
2011
We consider the problem of outcomes based budget allocations to chronic disease...
Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices
Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices
2011
We present branching‐on‐hyperplane methods for solving mixed integer...
Decomposition based interior point methods for two-stage stochastic convex quadratic programs with recourse
Decomposition based interior point methods for two-stage stochastic convex quadratic programs with recourse
2009
Zhao showed that the log barrier associated with the recourse function of two-stage...
On the value of binary expansions for general mixed-integer linear programs
On the value of binary expansions for general mixed-integer linear programs
2002
We study the use of binary variables in reformulating general mixed-integer linear...
A study of the augmented system and column-splitting approaches for solving two-stage stochastic linear programs by interior-point methods
A study of the augmented system and column-splitting approaches for solving two-stage stochastic linear programs by interior-point methods
1995
Linear programs that arise in two-stage stochastic programming offer a particularly...
Asymptotic convergence in a generalized predictor–corrector method
Asymptotic convergence in a generalized predictor–corrector method
1996
The asymptotic convergence properties of a generalized predictor–corrector...
A general parametric analysis approach and its implication to sensitivity analysis in interior point methods
A general parametric analysis approach and its implication to sensitivity analysis in interior point methods
1996
Adler and Monteiro developed a parametric analysis approach that is naturally related...
Solving symmetric indefinite systems in an interior-point method for linear programming
Solving symmetric indefinite systems in an interior-point method for linear programming
1993
The authors describe an implementation of a primal-dual path following method for...
Finding an interior point in the optimal face of linear programs
Finding an interior point in the optimal face of linear programs
1993
The authors study the problem of finding a point in the relative interior of the...
Quadratic convergence in a primal-dual method
Quadratic convergence in a primal-dual method
1993
It is shown that the Mizuno-Todd-Ye iteration predictor-corrector primal-dual...
On computing the center of a convex quadratically constrained set
On computing the center of a convex quadratically constrained set
1991
The authors propose a method for finding analytic center of a convex feasible region...
A computational comparison of the network simplex method with the dual affine scaling method
A computational comparison of the network simplex method with the dual affine scaling method
1991
The authors compare the performance of an implementation of dual affine scaling method...
Papers per page: