Skip to main content
Log in

Special ordered sets and an application to gas supply operations planning

  • Published:
Mathematical Programming Submit manuscript

Abstract

Special Ordered Sets provide a powerful means of modeling nonconvex functions and discrete requirements, though there has been a tendency to think of them only in terms of multiple-choice zero-one programming. This paper emphasizes the origins and generality of the special ordered set concept, and describes an application in which type 2 sets are used in several forms to model both logical conditions and nonlinear functions.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • E.M.L. Beale, “Two transportation problems,” in: G. Kreweras and G. Morlat, eds.,Proceedings of the Third International Conference on Operational Research (Dunod, Paris and English Universities Press, London, 1963) 780–788.

    Google Scholar 

  • E.M.L. Beale,Mathematical Programming in Practice (Pitmans, London and Wiley, New York, 1968).

    Google Scholar 

  • E.M.L. Beale, “Advanced algorithmic features for general mathematical programming systems,” in J. Abadie, ed.,Integer and Nonlinear Programming (North-Holland Publishing Company, Amsterdam, 1970) pp. 119–137.

    Google Scholar 

  • E.M.L. Beale, “Branch and bound methods for mathematical programming systems,”Annals of Discrete Mathematics 5 (1979) 201–219.

    Google Scholar 

  • E.M.L. Beale, Integer programming, in: K.Schittkowski, ed.,Computational Mathematical Programming NATO ASI Series F: Computer and System Sciences, Vol. 15 (Springer-Verlag, Berlin, 1985) 1–24.

    Google Scholar 

  • E.M.L. Beale and J.J.H. Forrest, “Global optimization using special ordered sets,”Math. Prog. 10 (1976) 52–69.

    Google Scholar 

  • E.M.L. Beale and J.J.H. Forrest, “Global optimization as an extension of integer programming,” in: L.C.W. Dixon and G.P. Szego, eds.,Towards Global Optimization 2 (North-Holland Publishing Company, Amsterdam, 1978) 131–149.

    Google Scholar 

  • E.M.L. Beale and J.A. Tomlin, “Special facilities in a general mathematical programming system for non-convex problems using ordered sets of variables,” in: J. Lawrence, ed.,Proceedings of the Fifth International Conference on Operational Research (Tavistock Publications, London, 1970) 447–454.

    Google Scholar 

  • M. Benichou, J.M. Gauthier, G. Hentges and G. Ribière, “The efficient solution of large-scale linear programming problems-Some algorithmic techniques and computational results,”Math. Prog. 13 (1977) 280–322.

    Google Scholar 

  • H. Crowder, E.L. Johnson and M.W. Padberg, “Solving large-scale zero-one linear programming problems,”Operations Res. 31 (1983) 803–834.

    Google Scholar 

  • G.B. Dantzig,Linear Programming and Extensions (Princeton University Press, Princeton, NJ, 1963).

    Google Scholar 

  • G.B. Dantzig and J.A. Tomlin, E.M.L. Beale, FRS; friend and colleague,Math. Prog. 38 (1987) 117–131.

    Google Scholar 

  • J.J.H. Forrest, J.P.H. Hirst and J.A. Tomlin, “Practical solution of large mixed integer programming problems with UMPIRE,”Management Sci. 20 (1974) 736–773.

    Google Scholar 

  • Ketron, Inc., MPSIII users manual (revised, 1986).

  • A.H. Land and A.G. Doig, “An automatic method for solving discrete programming problems,”Econometrica 28 (1960) 497–520.

    Google Scholar 

  • C.E. Miller, “The simplex method for local separable programming,” in R.L. Graves and P. Wolfe, eds.,Recent Advances in Mathematical Programming (McGraw-Hill, New York, 1963) 69–100.

    Google Scholar 

  • M.J.D. Powell, “A biographical memoir of Evelyn Martin Lansdowne Beale, FRS,”Biographical Memoirs of Fellows of the Royal Society 33 (1987).

  • Scicon, Ltd., SCICONIC/VM users guide (Milton Keynes MK17 8LX, England, 1986).

  • J.A. Tomlin, “Branch and bound methods for integer and non-convex programming,” in: J. Abadie, ed.,Integer and Nonlinear Programming (North-Holland Publishing Company, Amsterdam, 1970) 437–450.

    Google Scholar 

  • J.A. Tomlin “A suggested extension of special ordered sets to non-separable non-convex programming problems,” in: P. Hansen, ed.,Studies on Graphs and Discrete Programming (North-Holland Publishing Company, Amsterdam, 1981) 359–370.

    Google Scholar 

  • J.A. Tomlin and J.S. Welch, “MIPIII-a SLEUTH based mixed integer programming system,” in:Proceedings of SHARE 57, Chicago, Illinois (1981) 537–564.

  • S. Vajda,Readings in Linear Programming (Pitmans, London and Wiley, New York, 1958).

    Google Scholar 

  • H.P. Williams,Model Building in Mathematical Programming, second edition (Wiley, New York, 1985).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Now at IBM Almaden Research Center, San Jose, CA 95120.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tomlin, J.A. Special ordered sets and an application to gas supply operations planning. Mathematical Programming 42, 69–84 (1988). https://doi.org/10.1007/BF01589393

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01589393

Key words

Navigation