Showing papers by "John M. Wilson published in 1998"
TL;DR: In this paper, an introduction to stochastic programming is presented, which is based on the idea of Stochastic Programming (SPP) and is used in our work.
Abstract: (1998). Introduction to Stochastic Programming. Journal of the Operational Research Society: Vol. 49, No. 8, pp. 897-898.
1,274 citations
TL;DR: A Historical Sketch on Sensitivity Analysis and Parametric Programming T.J. Greenberg and the Optimal Set and Optimal Partition Approach.
Abstract: Foreword. Preface. 1. A Historical Sketch on Sensitivity Analysis and Parametric Programming T. Gal. 2. A Systems Perspective: Entity Set Graphs H. Muller-Merbach. 3. Linear Programming 1: Basic Principles H.J. Greenberg. 4. Linear Programming 2: Degeneracy Graphs T. Gal. 5. Linear Programming 3: The Tolerance Approach R.E. Wendell. 6. The Optimal Set and Optimal Partition Approach A.B. Berkelaar, et al. 7. Network Models G.L. Thompson. 8. Qualitative Sensitivity Analysis A. Gautier, et al. 9. Integer and Mixed-Integer Programming C. Blair. 10. Nonlinear Programming A.S. Drud, L. Lasdon. 11. Multi-Criteria and Goal Programming J. Dauer, Yi-Hsin Liu. 12. Stochastic Programming and Robust Optimization H. Vladimirou, S.A. Zenios. 13. Redundancy R.J. Caron, et al. 14. Feasibility and Viability J.W. Chinneck. 15. Fuzzy Mathematical Programming H.-J. Zimmermann. Subject Index.
195 citations
TL;DR: The facilities layout problem is concerned with a given number of facilities of some system which are to be laid out in a plane region, such as a factory floor or a flat building site as mentioned in this paper.
Abstract: The facilities layout problem is concerned with a given number of facilities of some system which are to be laid out in a plane region, such as a factory floor or a flat building site The aim of the classical facilities layout problem is to produce a plan drawn to scale which shows the relative positions of the facilities to be laid out in order to optimise some measure of the performance of the system We assume that the region P, in which the facilities are to be laid out, is a rectangle and that each of the facilities to be laid out in it is to be a connected subregion of given area, of arbitrary shape, except that all facility boundaries are straight-line segments that are parallel to the perimeter of P In many practical layout scenarios there are regions in which it is forbidden to locate facilities This sometimes occurs when a factory is to be redesigned and certain existing facilities are to remain where they are In other scenarios, the forbidden regions represent areas which cannot contain any facilities at all, eg, for security, transport, technical, or other reasons We devise integer programming models for the facilities layout problem with forbidden areas, and report on computational experience in solving them
34 citations
01 Jan 1998
TL;DR: An approach to combine a genetic algorithm with traditional linear programming based branch and bound for integer programming is described in this paper and results look promising in certain aspects of speed and solution quality.
Abstract: An approach to combine a genetic algorithm with traditional linear programming based branch and bound for integer programming is described in this paper. Branch and bound provides a systematic search procedure for pure integer programming problems and a genetic approach offers the possibility of rapid movement towards a useful solution. Hence the two approaches look worthy of combination as a way to solve certain {0,1} integer programming problems. The approach has been tested out on satisfiability problems and computational results look promising in certain aspects of speed and solution quality.
1 citations
1 citations