Optimum Stratification Using Mathematical Programming Approach: A Review

[1]  Bahman Kalantari,et al.  An algorithm for quadratic zero-one programs , 1990 .

[2]  Ya-Xiang Yuan,et al.  A recursive quadratic programming algorithm that uses differentiable exact penalty functions , 1986, Math. Program..

[3]  M. J. Ahsan,et al.  Theory & Methods: An Optimal Multivariate Stratified Sampling Design Using Dynamic Programming , 2003 .

[4]  D. Goldfarb.  Extension of Davidon’s Variable Metric Method to Maximization Under Linear Inequality and Equality Constraints , 1969 .

[6]  T. Dalenius.  The Problem of Optimum Stratification , 1950 .

[7]  W. Bühler,et al.  Optimal stratification and grouping by dynamic programming , 1975 .

[8]  Nimrod Megiddo,et al.  Linear time algorithms for some separable quadratic programming problems , 1993, Oper. Res. Lett..

[10]  J. Neyman.  On the Two Different Aspects of the Representative Method: the Method of Stratified Sampling and the Method of Purposive Selection , 1934 .

[11]  M.G.M. Khan,et al.  Designing stratified sampling in economic and business surveys , 2015 .

[12]  Claude Fleury,et al.  Dual Methods for Convex Separable Problems , 1993 .

[13]  Y. Haimes,et al.  New approach for nonseparable dynamic programming problems , 1990 .

[14]  Tamás Terlaky,et al.  A Long-step barrier method for convex quadratic programming , 1993, Algorithmica.

[15]  Chung-lie Wang.  Dynamic programming and inequalities , 1990 .

[16]  Chung-Yee Lee,et al.  A dynamic programming algorithm for dynamic lot size models with piecewise linear costs , 1994, J. Glob. Optim..

[17]  Dimitri P. Bertsekas,et al.  Nonlinear Programming , 1997 .

[18]  J. E. Kelley,et al.  The Cutting-Plane Method for Solving Convex Programs , 1960 .

[19]  Andrew Whinston,et al.  A Comparison of Two Methods for Quadratic Programming , 1966, Oper. Res..

[20]  J. B. Rosen.  The gradient projection method for nonlinear programming: Part II , 1961 .

[21]  J. L. Hodges,et al.  The choice of stratification points , 1957 .

[22]  Andrew B. Whinston,et al.  Simplicial methods for quadratic programming , 1964 .

[23]  J. L. Hodges,et al.  Minimum Variance Stratification , 1959 .

[24]  A. S. Manne,et al.  On the Solution of Discrete Programming Problems , 1956 .

[25]  Selmer M. Johnson,et al.  A Linear Programming Approach to the Chemical Equilibrium Problem , 1958 .

[26]  M. G. Khan,et al.  Determining the optimum strata boundary points using dynamic programming , 2008 .

[27]  Chung-lie Wang,et al.  Dynamic programming and penalty functions , 1990 .

[28]  R. Bellman.  Dynamic programming. , 1957, Science.

[29]  Mohammed G. M. Khan,et al.  Determining the Optimum Stratum Boundaries Using Mathematical Programming , 2009, J. Math. Model. Algorithms.

[30]  J. B. Rosen.  The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints , 1960 .

[31]  D. Du,et al.  On Rosen's gradient projection methods , 1990 .

[32]  B. Eaves.  On Quadratic Programming , 1971 .

[33]  Robert L. Graves,et al.  A Principal Pivoting Simplex Algorithm for Linear and Quadratic Programming , 1967, Oper. Res..

[34]  Immanuel M. Bomze,et al.  A Global Optimization Algorithm for Concave Quadratic Programming Problems , 1993, SIAM J. Optim..

[35]  Des Raj.  A NOTE ON THE DETERMINATION OF OPTIMUM PROBABILITIES IN SAMPLING WITHOUT REPLACEMENT , 2016 .

[36]  Masao Fukushima,et al.  A successive quadratic programming algorithm with global and superlinear convergence properties , 1986, Math. Program..

[37]  M. J. Ahsan,et al.  Optimum stratification for exponential study variable under Neyman allocation , 2005 .