A note on composite concave quadratic programming

Operations Research Letters

Volumn 23, Issue 3-5, 1998, Pages 163-169

  Churilov, Leonid ^a,b   Ralph, Daniel ^b   Sniedovich, Moshe ^b  

^a MONASH UNIVERSITY   (Australia)

^b UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

Complementary pivoting procedure; Composite concave programming; Parametric programming; Quadratic programming

Indexed keywords

COMPLEMENTARY PIVOTING PROCEDURES; COMPOSITE CONCAVE QUADRATIC PROGRAMMING; PARAMETRIC PROGRAMMING;

ALGORITHMS; CONSTRAINT THEORY; PROBLEM SOLVING;

QUADRATIC PROGRAMMING;

EID: 0032178070     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0167-6377(98)00035-2     Document Type: Article

References (25)

1. N.S. Bakhvalov, N.P. Zhydkov, G.M. Kobel'kov, Numerical Methods, Nauka, Moscow, 1987 (in Russian).
2. J.C.G. Boot, Quadratic Programming: Algorithms, Anomalies, Applications, North-Holland, Amsterdam, 1964.
3. A. Byrne, M. Sniedovich, L. Churilov, Handling soft constraints via composite concave programming, Journal of the Operational Research Society 49 (1998) pp. 870-877.
4. A. Charnes, W.W. Cooper, Programming with linear fractional functionals, Naval Res. Logist. Quart. 9 (1962) 181-186.
5. R.W. Cottle, Jong-Shi Pang, R.E. Stone, The Linear Complementarity Problem, Academic Press, London, 1992.
6. R.W. Cottle, G.B. Dantzig, in: G.B. Dantzig, A.F. Veinott Jr. (Eds.), Complementary pivot theory of mathematical programming, Mathematics of the Decision Sciences, Part 1, American Mathematical Society, Providence, RI, 1968, pp. 115-136.
7. J.P. Dauer, R.J. Krueger, An iterative approach to goal programming, Oper. Res. Quart. 38 (1977) 671-681.
8. T. Gal, Postoptimality Analyses, Parametric Programming, and Related Topics, McGraw-Hill, London, 1979.
9. M. Frank, P. Wolfe, An algorithm for quadratic programming, Naval Res. Logist. Quart. 3 (1956) 95-110.
10. A.M. Geoffrion, Strictly concave parametric programming, Part I: basic theory, Management Sci. 13 (3) (1966) 244-253.
11. A.M. Geoffrion, Strictly concave parametric programming, Part II: additional theory and computational considerations, Management Sci. 13 (5) (1967) 359-370.
12. J.L. Kelley, The cutting-plane method for solving convex programs, J. Soc. Ind. Appl. Math. 8 (1960) 703-712.
13. H. Konno, P.T. Thach, H. Tuy, Optimization on Low Rank Nonconvex Structures, Kluwer Academic Publishers, Dordrecht, 1997.
14. J. Liebman, L. Lasdon, L. Schrage, A. Waren, Modeling and Optimization with GINO, The Scientific Press, New York, 1986.
15. L. Macalalag, M. Sniedovich, Generalized linear programming and sensitivity analysis techniques, Naval Res. Logistics 43 (1996) 397-413.
16. K.G. Murty, Linear Complementarity, Linear and Nonlinear Programming, Helderman Verlag, Berlin, 1988.
17. Optimization Subroutine Library - Guide and Reference, 3rd ed., IBM, 1991.
18. L. Rde, B. Westergren, Beta β Mathematics Handbook, 2nd ed., Studentlitteratur, Chartwell-Bratt Ltd, Lund, Sweden, 1990.
19. L. Schrage, LINDO. An Optimization Modeling System, 4th ed., The Scientific Press, New York, 1991.
20. M. Sniedovich, Dynamic Programming, Marcel Dekker, New York, 1992.
21. M. Sniedovich, Algorithmic and computational aspects of composite concave programming, Int. Trans. Oper. Res. 1 (1) (1994) 75-84.
22. M. Sniedovich, E. Macalalag, S. Findlay, The simplex method as a global optimizer: a C-programming perspective, J. Global Optim. 4 (1994) 89-109.
23. R.E. Steuer, Multiple Criteria Optimization: Theory, Computation and Application, Wiley, New York, 1986.
24. C. Van de Panne, Methods for Linear and Quadratic Programming, North-Holland, Amsterdam, 1975.
25. M. Zeleny, Linear Multiobjective Programming, Lecture Notes in Economics and Mathematical Programming, 3rd ed. Revised, Wiley, New York, 1974.