This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
P.L. Bricker: Bounding a class of nonconvex linearly-constrained resource allocation problems via the surrogate dual, Mathematical Programming 18 (1980) 68–83.
J.-P. Crouzeix: A duality framework in quasiconvex programming, in Generalized Concavity in Optimization and Economics, eds. Shaible S., Ziemba W.T., Academic Press, New York, (1981), 207–225.
J.J. Dinkel, G.A. Kochenberger: An implementation of surrogate constraint duality, Operations Research 26 (1978), 358–364.
M.E. Dyer: Calculating surrogate constraints, Mathematical Programming 19 (1980) 255–278.
W. Findeisen, J. Szymanowski, A. Wierzbicki: Theory and Computational Methods of Optimization, PWN, Warszawa, 1977, (in Polish).
M.L. Fisher, W.D. Northup, J.F. Shapiro: Using duality to solve discrete optimization problems: theory and computational experience, Mathematical Programming Study 3 (1975) 56–94.
M.L. Fisher, B.J. Lageweg, J.K. Lenstra, A.H.G. Rinooy kan: Surrogate duality relaxation for job shop scheduling, Discrete Applied Mathematics 5 (1983) 1, 65–75.
R.S. Garfinkel, G.L. Nemhauser, Integer Programming, John Wiley & Sons, New York, 1972.
A.M. Geoffrion: Lagrangean relaxation and its uses in integer programming, Mathematical Programming Study 2 (1974) 82–114.
F. Glover: A multiphase-dual algorithm for the zero-one-integer programming problem, Operations Research 13 (1965) 879.919.
F. Glover: Surrogate constraints, Operations Research 16 (1968), 741–749.
F. Glover: Surrogate constraint duality in mathematical programming, Operations Research 23 (1975) 434–451.
H.J. Greenberg, W.P. Pierskalla: Surrogate mathematical programs, Operations Research 18 (1970) 924–939.
H.J. Greenberg, W.P. Pierskalla: A review of quasi-convex functions, Operations Research 19 (1971) 1553–1570.
H.J. Greenberg, W.P. Pierskalla: Quasi-conjugate functions and surrogate duality, Cahiers du Centre d'Etudes de Recherche Operationnelle 15 (1973) 437–448.
H.J. Greenberg: The generalised penalty function surrogate model, Operations Research 21 (1973) 162–178.
H. Held, P. Wolfe, H.P. Crowder: A validations of subgradient optimisation, Mathematical Programming 6 (1974) 62–88.
M.H. Karwan, R.L. Rardin: Some relationships between Lagrangean and surrogate duality in integer linear programming, Mathematical Programming 17 (1979) 320–334.
M.H. Karwan, R.L. Rardin: Surrogate duality in a branch-and-bound procedure, Naval Research Logistics Quarterly 28 (1981) 1, 93–101.
M.H. Karwan, R.L. Rardin: Surrogate dual multiplier search procedures in integer programming, Operations Research 32 (1984), 52–69.
M.H. Karwan, R.L. Rardin, S. Sarin: A new surrogate dual multiplier search procedure, Technical Report, August 1984, North Carolina A. a. T. State University, Grensboro.
D.G. Luenberger: Quasi-convex programming, SIAM Journal of Applied Mathematics 16 (1968) 1090–1095.
W. Oettli: Optimality conditions involving generalized convex mappings, in Generalized Concavity in Optimization and Economics, eds. Schaible S., Ziemba W.T., Academic Press, New York, (1981), 227–238.
B.T. Polyak: A general method of solving extremal problems, Doklady Akademi Nauk SSSR 174 (1967) 33–36.
R.T. Rockafellar: Convex Analysis, Princeton University Press, Princeton, New Jersey, 1970.
J. Sikorski, K. Mizukami: Three algorithms for calculating surrogate constraints in integer programming problems, Control & Cybernetics 13 (1984) 375–397.
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag
About this paper
Cite this paper
Sikorski, J. (1986). Quasi — Subgradient algorithms for calculating surrogate constraints. In: Malanowski, K., Mizukami, K. (eds) Analysis and Algorithms of Optimization Problems. Lecture Notes in Control and Information Sciences, vol 82. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0007163
Download citation
DOI: https://doi.org/10.1007/BFb0007163
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16660-3
Online ISBN: 978-3-540-39844-8
eBook Packages: Springer Book Archive