Multiple choice programming: an APL approach

ABSTRACT

In this paper, we introduce a set of APL code for the optimization in multiple choice programming using the special-ordered-set branch-and-bound procedure incorporating the partitioning strategy of weighted-mean method.

REFERENCES

• 1: Beale, E. M. L. and Tomlin, j. A., "Special Facilities in A General Mathematical Programming System for Non-Convex Problems Using Ordered Sets of Variables", Proceedings of the Fifth FORS Conference, pp. 447-454 (1970).
• 2: Dantzig, G. B. and Van Slyke, R. M., "Generalized Upper Bounding Technique", Journal of Computer and System Sciences 1, pp. 213-226 (1967).
• 3: Escudero, L. F., Applied Numerical Modeling, Prentech Press, London, pp. 535-550 (1979).
• 4: Geoffrion, A. M. and Marsten, R. E., "Integer Programming Algorithms: A Rramework and State-of-the-Art Survey", Management Science 18, pp. 465-491 (1972).
• 5: Gomery, R. E., "An Algorithm for the Mixed Integer Problem", RM-2579, The RAND Corporation, Santa Monica, California (1960).
• 6: Healey, W. C. " Multiple Choice Programming ", Operations Research 12, pp. 122-138 (1964),.
• 7: Snyder, R. D. "Linear Programming with Special Ordered Sets", journal of Operations Research Society 35, pp. 69-74 (1984),.
• 8: Tomlin, J. A., "Branch-and-Bound Methods for Integer and Non-Convex Programming", Integer and Nonlinear Programming, North-Holland, pp. 437-450 (1970)

INDEX TERMS

Primary Classification:
  D. Software
  D.3 PROGRAMMING LANGUAGES
      D.3.2 Language Classifications

          Nouns: APL

Additional Classification:
  G. Mathematics of Computing
  G.1 NUMERICAL ANALYSIS
      G.1.6 Optimization
          Subjects: Integer programming
  G.2 DISCRETE MATHEMATICS
      G.2.1 Combinatorics
          Subjects: Combinatorial algorithms

General Terms:
Algorithms, Languages