Linear programming and its applications

Linear Programming and its Applications

Volumn , Issue , 2007, Pages 1-380

  Eiselt, H A ^a   Sandblom, C L ^b  

^a UNIVERSITY OF NEW BRUNSWICK   (Canada)

^b DALHOUSIE UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84892059173     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/978-3-540-73671-4     Document Type: Book

References (194)

1. Ackoff RL (1974) Redesigning the future: a systems approach to societal problems. Wiley, New York, NY
2. Ackoff RL (1978) The art of problem solving. Wiley, Inc., New York, NY
3. Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows: theory, algorithms, and applications. Prentice-Hall, Englewood Cliffs, NJ
4. Anbil R, Gelman E, Patty B, Tanga R (1991) Recent advances in crew-pairing optimization at American Airlines. Interfaces 21:62-74
5. 1 and Chebyshev estimation. Mathematical Programming 5:73-87
6. Ballestero E, Romero C (1998) Multiple criteria decision making and its application to economic problems. Kluwer, Boston Dordrecht London
7. Barsow AR (1959) What is linear programming. Moscow: 90-101
8. Bazaraa MS, Sherali HD, Shetty CM (1993) Nonlinear programming: theory and algorithms. Wiley, New York, NY
9. Beale E M L (1955) Cycling in the dual simplex algorithm. Naval Research Logistics Quarterly 2:269-276
10. Bellman RE, Zadeh LA (1970) Decision-making in a fuzzy environment. Management Science 17:141-164
11. Benayoun R, de Montgolfier J, Tergny J, Laritchev O (1971) Linear programming with multiple objective functions: step method (STEM). Mathematical Programming 1:366-375
12. Benders JF (1962) Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik 4:238-252
13. Bhatti MA (2000) Practical optimization methods with Mathematica applications. Springer, New York, NY
14. Bland RG (1977) New finite pivoting rules for the simplex method. Mathematics of Operations Research 2:103-107
15. Bracken J, McGill J (1973) Mathematical programs with optimization problems in the constraints. Operations Research 21:37-44
16. Bradley SP, Hax AC, Magnanti TL (1977) Applied mathematical programming. Addison Wesley, Reading, MA
17. Bretscher O (1997) Linear algebra with applications. Prentice-Hall, Upper Saddle River, NJ
18. Brown GW, Koopmans TC (1951) Computational suggestions for maximizing a linear function subject to linear inequalities. In: Koopmans TC (ed) Chapter XXV in Activity analysis of production and allocation. Cowles Commission Monograph 13, Wiley, New York, NY, pp 377-380
19. Buchanan J, Gardiner L (2003) A comparison of two reference point methods in multiple objective mathematical programming. European Journal of Operational Research 149:17-34
20. Bunch JR, Parlett BN (1971) Direct methods for solving symmetric indefinite systems of linear equations. SIAM Journal on Numerical Analysis 8:639-655
21. Charnes A (1952) Optimality and degeneracy in linear programming. Econometrica 20:160-170
22. Charnes A, Cooper WW (1961) Management models and industrial applications of linear programming. Wileys, New York, NY
23. Charnes A, Cooper WW, Ferguson RO (1955) Optimal estimation of executive compensation by linear programming. Management Science 1, 138-151
24. Charnes A, Cooper WW, Henderson A (1953) An introduction to linear programming. Wiley, New York
25. Charnes A, Cooper WW, Mellon B (1952) Blending aviation gasolines-a study in programming interdependent activities in an integrated oil company. Econometrica 20:135-159
26. Charnes, A, Cooper WW, Rhodes E (1978) Measuring the efficiency of decision-making units. European Journal of Operational Research 2:429-444
27. Charnes A, Klingman D (1971) The more-for-less paradox in the distribution model. Cahiers de centre d'études recherche operationnelle 13:11-22
28. Charnes A, Lemke CE (1954) Computational theory of linear programming I: the bounded variables problem. ONR Research Memo No. 10, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, PA
29. Chen G, Huang X, Yang X (2005) Vector optimization. Lecture Notes in Economics & Mathematical Systems 541, Springer, Berlin
30. Cochrane JL, Zeleny M (eds) (1973) Multiple criteria decision making. University of South Carolina Press, Columbia, SC
31. Cohon, J. L. (1978): Multiobjective Programming Planning. In: Mathematics in Science and Engineering, Vol. 140, Academic Press, New York.
32. Collette Y, Siarry P (2003, 2nd edn.) Multiobjective optimization: principles and case studies. Springer, Berlin Heidelberg New York
33. Colson B, Marcotte P, Savard G (2005) Bilevel programming: a survey. OR 3:87-107
34. Cook SA (1971) The complexity of theorem-proving procedures. Proceedings of the 3rd Annual ACM Symposium on the Theory of Computing, New York, pp. 151-158
35. Cooper L, Steinberg D (1970) Introduction to methods of optimization. W. B. Saunders Co., Philadelphia, PA
36. Dantzig GB (1951) Application of the simplex method to a transportation problem. In: Koopmans TC (ed), Activity analysis of production and allocation. Cowles Commission Monograph 13, Wiley, New York, pp 359-373
37. Dantzig GB (1954) Notes on linear programming, Parts VIII, IX, X, Upper bounds, Secondary constraints and block triangularity in linear programming. The Rand Corporation, Research Memorandum RM-1367, Oct. 4, 1954. Published under the same title in Econometrica 23, 1955, 174-183
38. Dantzig GB (1963) Linear programming and extensions. Princeton University Press, Princeton, NJ
39. Dantzig GB (1982) Reminiscences about the origins of linear programming. In: Bachem A, Grötschel M, Korte B (eds). Mathematical programming. The State of the Art. Springer, Berlin Heidelberg New York, pp 78-86
40. Dantzig GB (1991) Linear programming. In: Lenstra JK, Rinnooy Kan AHG, Schrijver A (eds) History of mathematical programming: a collection of personal reminiscences. Elsevier Science, Amsterdam, pp 19-31
41. Dantzig GB, Ford LR, Fulkerson DR (1956) A primal-dual algorithm for linear programming. In: Kuhn HW, Tucker AW (eds) Linear inequalities and related systems. Annals of Mathematics Studies, Princeton University Press, Princeton, NJ, pp 171-181
42. Dantzig GB, Orchard-Hays W (1953) Notes on linear programming: part V - alternate algorithm for the revised simplex method using product form of the inverse. TM-1268, The RAND Corporation, Santa Monica, CA
43. Dantzig GB, Fulkerson DR, Johnson SM (1954) The solution of a large-scale traveling salesman problem. Operations Research 2:393-410
44. Dantzig GB, Orden A (1953) Duality theorems, Rand report RM-1265. The Rand Corporation, Santa Monica, CA
45. Dantzig GB, Thapa MN (1997) Linear programming. I: Introduction. Springer, New York Berlin Heidelberg
46. Dantzig GB, Thapa MN (2003) Linear programming, 2: Theory and extensions. Springer, New York Berlin Heidelberg
47. Dantzig GB, Van Slyke RM (1967) Generalized upper bounded techniques for linear programming. Journal of Computer and Systems Sciences 1:213-226
48. Dantzig GB, Wolfe P (1961) The decomposition algorithm for linear programs. Econometrica 29:767-778
49. Dantzig GB, Wolfe P (1960) Decomposition principle for linear programs. Operations Research 8:101-111
50. DeMarr R (1983) External pivoting in linear programming. Abstracts presented to the American Mathematical Society, issue 22, vol 4, no 1
51. Dempe S (2002) Foundations of bilevel programming, Kluwer, Boston, MA
52. Dikin I (1967) Iterative solution of problems of linear and quadratic programming. Soviet Mathematics Doklady 8:674-675
53. Dinkelbach W (1969) Sensitivitätsanalysen und parametrische Programmierung. In: Ökonometrie und Unternehmensforschung XII, Springer, Berlin Heidelberg New York
54. ij negative and transshipment problems. Naval Research Logistics Quarterly 22:751-776
55. Dyer JC (1972) Interactive goal programming. Management Science 19:62-70
56. Edmonds J (1965) Paths, trees, and flowers. Canadian Journal of Mathematics 17:449-467
57. Egerváry J (1931) Matrixok kombinatorius tulajdonsá gairól (On combinatorial properties of matrices, in Hungarian). Mathematikai és Fizikai Lapok 38:16-28
58. Ehrgott M (2005) Multicriteria optimization. Springer, Berlin Heidelberg New York
59. Eiselt HA; Laporte G (1987) Combinatorial optimization problems with soft and hard requirements. Journal of the Operational Research Society 38:785-795
60. Eiselt HA, Pederzoli G, Sandblom C-L (1987) Continuous optimization. W. DeGruyter, Berlin
61. Eiselt HA, Sandblom C-L (1985) External pivoting in the simplex algorithm. Statistica Neerlandica 39:327-341
62. Eiselt HA, Sandblom C-L (1990) Experiments with external pivoting. Computers & Operations Research 17:325-332
63. Eiselt HA, Sandblom C-L (2000a) The bounce algorithm for mathematical programming. Mathematical Methods of Operations Research 52:173-183
64. Eiselt HA, Sandblom C-L (eds and authors) (2000) Integer programming and network models. Springer, Berlin Heidelberg New York
65. Eiselt HA, Sandblom C-L (eds & authors) (2004) Decision analysis, location models, and scheduling problems. Springer, Berlin Heidelberg New York
66. Evans JP, Steuer RE (1973) A revised simplex method for linear multiple objective programming. Mathematical Programming 5:54-72
67. Farrell JM (1957) The measurement of productive efficiency. Journal of the Royal Statistical Society 120:253-281
68. Fiacco AV (1979) Barrier methods for nonlinear programming. In: Holzman AG (ed) Operations research methodology. Marcel Dekker, New York Basel, pp 377-440
69. Fiacco AV, McCormick GP (1968) Nonlinear programming: sequential unconstrained minimization techniques. Wiley, New York, NY
70. Figueira J, Greco S, Ehrgott M (2005) aMultiple criteria decision analysis: state of the art surveys. Springer, New York, NY
71. Finke G (1977) A unified approach to reshipment, overshipment and post-optimization problems. In: Stoer J (ed) Optimization techniques. Proceedings of the 8th IFIP Conference, Part 2. Lecture Notes in Control and Transportation Sciences 7, Springer, Berlin Heidelberg New York, pp 201-208
72. Finke G (1983) Minimizing overshipments in bottleneck transportation problems. INFOR 21:121-135
73. Fliege J, Vicente LN (2006) Multicriteria approach to bilevel optimization. Journal of Optimization Theory and Applications 131:209-225
74. Ford Jr LR, Fulkerson DR (1954) Maximal flow through a network. Rand Research Memorandum 1400, The RAND Corporation, Santa Monica Subsequently published under the same title in the Canadian Journal of Mathematics 8, 1956, 399-404
75. Fourier J B J (1826) Solution d'une question particulière du calcul des inégalités. Nouveau Bulletin des Sciences par la Société philomathique de Paris: 99-100
76. Frank A (2005) On Kuhn's Hungarian method-a tribute from Hungary. Naval Research Logistics 52:2-5
77. Frisch KR (1956) La résolution des problèmes de programme linéaire par la méthode du potential logarithmique. Cahiers du Seminaire d'Économetrie 4:7-20
78. Gal T (1979) Postoptimality analyses, parametric programming and related topics. McGraw Hill, New York
79. Gal T (1984) Linear parametric programming - A brief survey. Mathematical Programming Study 21:43-68
80. Gale D (1960) The theory of linear economic models. Mc-Graw-Hill, New York, NY
81. Gale D, Kuhn HW, Tucker AW (1951) Linear programming and the theory of games: Koopmans, T. C. (ed), Activity analysis of production and allocation. Cowles Commission Monograph 13:317-329
82. Garey MR, Johnson DS (1979) Computers and intractability: A guide to the theory of NP-completeness. Freeman, San Francisco, CA
83. Garfinkel RS, Rao M (1976) Bottleneck linear programming. Mathematical Programming 11:291-298
84. Gass SI, Assad AA (2005) An annotated timeline of operations research: An informal history. Kluwer, New York, NY
85. Gass SI, Saaty T (1955) The computational algorithm for the parametric objective function. Naval Research Logistics Quarterly 2:39
86. Gauss CF (1826) Theoria combinationis observationum erroribus minimis obnoxiae. Werke, vol. 4, Göttingen, Germany
87. Garner Garille S, Gass SI (1981) Stigler's diet problem revisited. Operations Research 49:1-13
88. Geoffrion AM (1967) Solving bicriterion mathematical programs. Operations Research 15:39-54
89. Geoffrion AM, Dyer JS, Feinberg A (1972) An interactive approach for multi-criterion optimization with an application to the operation of an academic department. Management Science 19:357-368
90. Gilmore PC, Gomory RE (1961) A linear programming approach to the cutting stock problem. Operations Research 9:849-859
91. Gilmore PC, Gomory RE (1963) A linear programming approach to the cutting stock problem - Part II. Operations Research 11:863-888
92. Gordan P (1873) Über die Auflösung linearer Gleichungen mit reellen Coefficienten. Mathematische Annalen 6:23-28
93. Grattan-Guinness I (1970) Joseph Fourier's anticipation of linear programming. Operational Research Quarterly 21:361-364
94. Gutin G, Punnen A (eds) (2002) The traveling salesman problem and its variations. Kluwer, Boston Dordrecht London
95. Hirsch WM (1957) Hirsch conjecture, verbal communication to Dantzig
96. Hitchcock FL (1941) The distribution of a product from several sources to numerous localities. Journal of Mathematical Physics 20:224-230
97. Hobson RF, Weinkam JJ (1979) Curve fitting. In: Holzman AG (ed) Operations research methodology. Dekker, New York Basel, pp 335-362
98. Hoffman AJ (1953) Cycling in the simplex algorithm. National Bureau of Standards, Report No. 2974, Washington, D. C
99. Hoffman AJ, Kruskal JG (1956) Integral boundary points of convex polyhedra. In: Kuhn HW, Tucker AW (eds) Linear inequalities and related systems. Annals of Mathematics Studies, Princeton University Press, Princeton, NJ, pp 223-246
100. Huard P (1967) Resolution of mathematical programming with nonlinear constraints by the method of centers. In: Abadie J (ed) Nonlinear programming. North-Holland, Amsterdam, pp 209-219
101. Hussein ML, Al-Ghaffar F S A (1996) An interactive approach for vector optimization problems. European Journal of Operational Research 89:185-192
102. Ignizio JP (1982) Linear programming in single-& multiple-objective systems. Prentice-Hall, Englewood Cliffs, NJ
103. Ignizio JP, Cavalier TM (1994) Linear programming. Prentice-Hall, Englewood Cliffs, NJ
104. Ijiri Y (1965) Management goals and accounting for control. Rand McNally, Chicago, IL
105. Inuiguchi M, Ramík J (2000) Possibilistic linear programming: A brief review of fuzzy mathematical programming and a comparison with stochastic programming in portfolio selection problem. Fuzzy Sets and Systems 111:3-28
106. Jeroslow, RG (1973) There cannot be any algorithm for integer programming with quadratic constraints. Operations Research 21:221-224
107. Jones DF, Tamiz M (2002) Goal programming in the period 1990-2000. In: Ehrgott M, Gandibleux X (eds) Multiple criteria optimization: State of the art annotated bibliographic surveys. Springer, New York, NY
108. Kantorovich LV (1939) (1960) Mathematical methods in the organization and planning of production. Translation of the 1939 original (in Russian). In: Management Science 6:366
109. Karmarkar N (1984) A new polynomial-time algorithm for linear programming. Combinatorica 4:373-395
110. Karp RM (1972) Reducibility among combinatorial problems. In: Miller R E, Thatcher J W (eds) Complexity of computer computations. Plenum Press, New York, pp. 85-103
111. Khachian LG (1979) Polynomial algorithm for linear programming. Doklady Akademii Nauk SSSR 244:1093-1096 (in Russian), translated into English in the same year in Soviet Mathematics Doklady 20:191-194
112. Klee V, Minty GJ (1972) How good is the simplex algorithm. In: Shisha O (ed) Inequalities III. Academic Press, New York, pp 159-175
113. Klee VL, Walkup DW (1967) The d-step conjecture for polyhedra of dimension d < 6. Acta Mathematica 117:53-78
114. König D (1931) Graphok és matrixok (Graphs and matrices, in Hungarian). Mathematikai és Fizikai Lapok 38:116-119
115. Koopmans TC (1951) Activity analysis of production and allocation. Wiley, New York, NY
116. Koopmans TC (1951a) Analysis of production as an efficient combination of activities. In: Koopmans TC (ed) Activity analysis of production and allocation. Wiley, New York, NY, pp. 33-97
117. Koopmans TC, Beckmann M (1957) Assignment problems and the location of economic activities. Econometrica 25:53-76
118. Kuhn HW (1955) The Hungarian method for the assignment problem. Naval Research Logistics Quarterly 2:83-97
119. Kuhn HW (1991) On the origin of the Hungarian method. In: Lenstra JK, Rinnooy Kan AHG, Schrijver A (eds) History of mathematical programming: a collection of personal reminiscences. CWI, Amsterdam and North Holland, Amsterdam, The Netherlands, pp 77-81
120. Kuhn HW, Tucker AW (1951) Nonlinear programming. In: Neyman J (ed) Proceedings of second Berkeley symposium on mathematical statistics and probability. University of California Press, Berkeley, CA, pp 481-491
121. Kuhn HW, Tucker AW (eds) (1956) Linear inequalities and related systems. Annals of Mathematics Studies 38. Princeton, NJ
122. Ladner RE (1977) The computational complexity of provability in systems of modal propositional logics. SIAM Journal on Computing 6:467-480
123. Land AH, Doig AG (1960) An automatic method of solving discrete linear programming problems. Econometrica 28:496-520
124. Lawler EL, Lenstra JK, Rinnooy Kan A H G, Shmoys DB (1985) The traveling salesman problem: A guided tour of combinatorial optimization. Wiley, Chichester, United Kingdom
125. Lee SM (1972) Goal programming for decision analysis. Auerbach, Philadelphia, PA
126. Lemke CE (1954) The dual method of solving linear programming problems. Naval Research Logistics Quarterly 1:36-47
127. Lenstra JK, Rinnooy Kan A H G, Schrijver A (eds) History of mathematical programming: A collection of personal reminiscences. Elsevier, Amsterdam
128. Leontief WW (1936) Quantitative input and output relations in the economic system of the United States. Review of Economic Statistics 18:105-125
129. Levin AYu (1965) On an algorithm for the minimization of convex functions. Soviet Mathematics Doklady 6:286-290
130. Lootsma FA (1972) A survey of methods for solving constrained minimization problems via unconstrained minimization. In: Lootsma FA (ed) Numerical methods for non-linear optimization. Academic Press, London
131. Mangasarian OL (1969) Nonlinear programming. McGraw-Hill Publ. Co., New York, NY. Reprinted as SIAM Classic in applied mathematics 10, 1994, Philadelphia, PA
132. Manne AS (1953) Notes on parametric linear programming. Rand Paper P-468. The Rand Corporation, Santa Monica, CA
133. Marglin JA (1967) Public investment criteria. MIT, Cambridge, MA
134. Markowitz HM (1952) Portfolio selection. Journal of Finance 7:77-91
135. McCloskey JF (1987) The beginnings of operations research: 1934-1941. Operations Research 35:143-152
136. McMullen P (1970) The maximum numbers of faces of a convex polytope. Mathematika 17:179-184
137. Moore JH, Weatherford LR (2001) Decision modeling with Microsoft® Excel. Prentice Hall, Englewood Cliffs, NJ
138. Motzkin TS (1936) Beiträge zur Theorie der linearen Ungleichungen. Doctoral Thesis, Zürich, Switzerland
139. Murty KG (1986) The gravitational method for linear programming. Opsearch 23:206-214
140. Murty KG (1992) Network programming. Prentice Hall, Englewood Cliffs, NJ
141. Nemhauser GL, Wolsey LA (1988) Integer and combinatorial optimization. Wiley, New York, NY
142. Neumann J, von Morgenstern O (1944) Theory of games and economic behavior. Princeton University Press, Princeton, NJ
143. Nicholson K (2006) Linear algebra with applications. 5th edn. McGraw Hill, Boston, MA
144. Norback JP, Morris JG (1980) Fitting hyperplanes by minimizing orthogonal deviations. Mathematical Programming 19:102-105
145. Orchard-Hays W (1955) Notes on linear programming (Part 6) The RAND vode for the simplex method (SX4). Report 440, The RAND Corporation, Santa Monica, CA. (Based on the author's unpublished Master's Thesis in 1952)
146. Orden A (1952) Application of the simplex method to a variety of matrix problems. In: Orden A, Goldstein L (eds) Proceedings of the Symposium on linear inequalities and programming. pp 28-50
147. Overbay, S., Schorer, J., Conger, H. http://www.ms.uky.edu/~carl/ma330/ project2/al-khwa21.html, accessed 4/25/2007
148. Padberg M (1995) Linear optimization and extensions. Springer, Berlin Heidelberg New York
149. Pareto V (1906) Manuale di econnomia politica. Società Editrice Libraria, Milan, Italy
150. Parisot GR (1961) Résolution numérique approchée du problème de programmation linéaire par application de la programmation logarithmique. Revue française de la recherché opérationnelle 20:227-259
151. Parkinson CN (1957) Parkinson's law. Houghton Mifflin, Boston, MA
152. Pawlak Z (1991) Rough sets: Theoretical aspects of reasoning about data. Kluwer, Dordrecht
153. Philip J (1972) Algorithms for the vector maximization problem. Mathematical Programming 2:207-229
154. Rardin RL (1998) Optimization in operations research. Prentice-Hall, Upper Saddle River, NJ
155. Reeves GR, Franz LS (1985) A simplified interactive multiple objective linear programming procedure. Computers& Operations Research 12:589-601
156. Reeves GR, Hedin SR (1993) A generalized interactive goal programming procedure. Computers& Operations Research 20:247-253
157. Renegar J (1988) A polynomial-time algorithm based on Newton's method for linear programming. Mathematical Programming 40:59-93
158. Roos C, Terlaky T, Vial J-Ph (2006) Interior point methods for linear optimization. 2nd edn. Springer, New York, NY
159. Saigal R (1995) Linear programming. Kluwer, Boston, MA
160. Sakawa M (2002) Fuzzy multiobjective and multilevel optimization. In Ehrgott M., Gandibleux X. (eds) Multiple criteria optimization: state of the art annotated bibliographic survey, Kluwer, The Netherlands, pp 171-226
161. Schmalenbach E (1948) Pretiale Wirtschaftslenkung. Band 1: Die optimale Geltungszahl, Dresden, Germany
162. Schniederjans MJ (1984) Linear goal programming. Petrocelli Books, Princeton, NJ
163. Schniederjans M (1995) Goal programming: methodology and applications. Kluwer, Boston, MA
164. Shin WS, Ravindran A (1991) Interactive multiobjective optimization survey I: continuous case. Computers& Operations Research 18:97-114
165. Shor NZ (1970) Utilization of the operation of space dilation in the minimization of convex functions. Kibernetika 1:6-12 (in Russian), translated into English in the same year in Cybernetics 6:7-15
166. Sierksma G (2002) Linear and integer programming: theory and practice (2nd ed.) Marcel Dekker, New York, NY
167. Simmons DM (1972) Linear programming for operations research, Holden-Day, San Francisco, CA
168. Simonnard M (1966) Linear programming. Prentice-Hall, Englewood Cliffs, NJ
169. Simon HA (1957) Models of man. Wiley, Yew York, NY
170. Stadler W (1984) A comprehensive bibliography on multicriteria decision making. In: Zeleny M (ed) MCDM past decade and future trends. JAI Press, CT, pp 223-328
171. Steuer RE (1986) Multiple criteria optimization: theory, computation, and application. Wiley, New York, NY
172. Steuer R E (1995) The ADBASE multiple objective linear programming package. In Gu J, Chen J, Wei Q, Wang S (eds), Multiple criteria decision making, SCI-TECH, Windsor, England, pp 1-6
173. Stigler G (1945) The cost of subsistence. Journal of Farm Economics 25:303-314
174. Strassen V (1969) Gaussian elimination is not optimal. Numerische Mathematik 13:354-356
175. Sun M, Stam A, Steuer RE (1996) Solving multiple objective programming problems using feed-forward artificial neural networks: The interactive FFANN procedure. Management Science 42:835-849.
176. Swarc W (1971) The transportation paradox. Naval Research Logistics Quarterly 18:185-202
177. Tanino T, Tanaka T, Inuiguchi M (eds) (2003) Multi-objective programming and goal programming: theory and applications. Advances in soft computing 21, Springer, Berlin Heidelberg
178. Trzaskalik T, Michnik J (eds) (2002) Multiple objective and goal programming. Advances in soft computing 12, Springer, Berlin Heidelberg
179. Vanderbei RJ (2001) Linear programming: foundations and extensions. 2nd edn. Kluwer, Boston, MA
180. Vasant P, Nagarajan R, Yaacob S (2005) Fuzzy linear programming with vague objective coefficients in an uncertain environment. Journal of the Operational Research Society 56:597-603
181. Vicente LN (2001) Bilevel programming: introduction, history, and overview. In: Floudas CA, Pardalos PM (eds) Encyclopedia of optimization. Springer, New York
182. Vicente LN, Calamai PH (1994) Bilevel and multilevel programming: A bibliographic review. Journal of Global Optimization 5:291-306
183. von Neumann J (1947) On a maximization problem (manuscript). Institute for Advanced Study, Princeton, NJ, Nov. 1947
184. von Stackelberg H (1934) Marktform und Gleichgewicht. Springer, Vienna& Berlin
185. Walford, R. L. (2007) http://yarrow.best.vwh.net/Usda-data/foods-db.html accessed April 24, 2007
186. Yu PL (1973) Introduction to domination structures in multicriteria problems. In: Cochrane JL, Zeleny M (eds.) Multiple criteria decision making, University of South Carolina Press, Columbia SC, pp 249-261
187. Zadeh M (1963) Optimality and non-scalar-valued performance criteria. IEEE Transactions on Automatic Control AC 8:59-60
188. Zadeh LA (1979) Fuzzy sets. In: Holzman AG (ed) Operations research methodology. Marcel Dekker, New York Basel, pp 569-606
189. Zeleny M (1973) Compromise programming. In: Cochrane JL, Zeleny M (eds), Multiple criteria decision making. University of South Carolina Press, Columbia, SC, 262-301
190. Zhang S (1991) On anti-cycling rules for the simplex method. Operations Research Letters 10:189-192
191. Zimmermann H-J (1976) Description and optimization of fuzzy systems. International Journal of General Systems 2:209-215
192. Zimmermann H-J (1978) Fuzzy programming and linear programming with several objectives. Fuzzy Sets and Systems 1:45-55
193. Zionts S (1969) The criss-cross method for solving linear programming problems. Management Science 15:426-445
194. Zykina AV (2004) A generalized solution of an interactive goal programming problem. Cybernetics and Systems Analysis 40:277-283