Abstract
Mathematical programming is concerned with the extremization of a function f defined over an n-dimensional design space R n and bounded by a set S in the design space. The set S may be defined by equality or inequality constraints, and these constraints may assume linear or nonlinear form. The function f together with the set S in the domain of f is called a mathematical program or a mathematical programming problem. This terminology is in common usage in the context of problems which arise in planning and scheduling which are generally studied under operations research; the branch of mathematics concerned with the decision making process. Mathematical programming problems may be classified into several different categories depending on the nature and form of the design variables, constraint functions, and the objective function. However, only two of these categories are of interest to us, namely the linear and the nonlinear programming (commonly designated as LP and NLP, respectively).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Charnes, A. and Greenberg, H. J., “Plastic collapse and linear programming,” Bull. Am. Math. Soc., 57, 480, 1951.
Calladine, C.R., Engineering Plasticity. Pergamon Press, 1969.
Cohn, M.Z., Ghosh, S.K. and Parimi, S.R., “Unified approach to theory of plastic structures,” Journal of the EM Division, ASCE 5, pp. 1133–1158, 1972.
Neal, B. G., The plastic methods of structural analysis, 3rd edition, Chapman and Hall Ltd., London, 1977.
Zeman, P. and Irvine, H. M., Plastic design: an imposed hinge—rotation approach, Allen and Unwin, Boston, 1986.
Massonet, C.E. and Save, M.A., Plastic Analysis and Design, Beams and Frames, Vol. 1. Blaisdell Publishing Co., 1965.
Lin, T.Y. and Burns, N.H., Design of Prestressed Concrete Structures, 3rd ed. John Wiley and Sons, New York, 1981.
Parme, R.L. and Paris, G.H., “Designing for continuity in prestressed concrete structures,” Am. Concr. Inst. J., 48, pp. 54–64, 1951.
Morris, D., “Prestressed concrete design by linear programming,” J. Struct. D.v., ASCE 3, pp. 439–452, 1978.
Kirsch, U., “Optimum design of prestressed beams,” J. Computers and Structures 2, pp. 573–583, 1972.
Luenberger, D., Introduction to Linear and Nonlinear Programming, Addison—Wesley, Reading, Mass., 1973.
Majid, K.I., Nonlinear Structures, London, Butterworths, 1972.
Dantzig, G., Linear Programming and Extensions, Princeton University Press, Princeton, NJ, 1963.
Karmarkar, N., “A new polynomial—time algorithm for linear programming,” Combinatorica, 4, pp. 373–395, 1984.
Todd, M. J. and Burrell, B. P., “An extension of Karmarkar’s algorithm for linear programming using dual variables,” Algorithmica, 1, pp. 409–424, 1986.
Rinaldi, G., “A projective method for linear programming with box—type constraints,” Algorithmica, 1, pp. 517–527, 1986.
Strang, G., “Karmarkar’s algorithm and its place in applied mathematics,” The Mathematical Intelligence, 9, 2, pp. 4–10, 1987.
Vanderbei, R. F., Meketon, M. S., and Freedman, B. A., “A modification of Karmarkar’s linear programming algorithm,” Algorithmica, 1, pp. 395–407, 1986.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Haftka, R.T., Gürdal, Z., Kamat, M.P. (1990). Linear Mathematical Programming. In: Elements of Structural Optimization. Solid Mechanics and Its Applications, vol 1. Springer, Dordrecht. https://doi.org/10.1007/978-94-015-7862-2_3
Download citation
DOI: https://doi.org/10.1007/978-94-015-7862-2_3
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-015-7864-6
Online ISBN: 978-94-015-7862-2
eBook Packages: Springer Book Archive