Ahuja, R.K., dan Orlin, J.B. (2001). Inverse optimization. The Institute for Ope-rations Research and the Management Sciences. Vol.49. pp. 771783.
Ali, I., Singh, R.Y., dan Bari, A. (2011). Integer goal programming approach for finding a compromise allocation of repairable components. International Journal of Engineering, Science and Technology. Vol.3, No. 6, pp. 184-195.
Arthur, J. L., dan Ravindran, A. (1978). An efficient goal programming algorithm using constraint partitioning and variable elimination. Management Science, Informs. vol. 24(8). Pp. 867-868.
Burton, D., dan Toint, PL. (1992). On an instance of the inverse shortest paths problem, Mathematical Programming. Spinger. North-Holland New York.
Burton, D., dan Toint, PL. (1994). On the use of an inverse shortest paths algorithm for recovering linearly correlated costs. Mathematical Programming, Spinger.
North-Holland New York.
Cai, M.C., Yang, X.G., dan Zhang, J.Z. (1999). The complexity analysis of the inverse center location problem, Journal of Global Optimization. vol.15: pp 213218.
Chalmet, G. L., Lemonidis, L., dan Elzinga, D. (1986). An algorithm for the bi-criterion integer programming problem. European Journal of Operational Re-search. Vol. 25, pp.192-300.
Charnes, A., dan Chopper, W.W. (1961). Management Models and Industrial Ap-plications of Linear Programming. Vols. I and II, Wiley. New York.
Charnes, A., dan Chopper, W.W. (1975). Goal Programming and multiple multiob-jective optimization. Carnegie-Mellon University. Pittsburgh, Pennsylvania.
Charnes, A., dan Cooper,W.W. (1977). Goal programming and multiple objective optimizations: Part 1. European Journal of Operational Research, Volume 1.
Pp. 39-54.
Crowder, L.J., dan Sposito, V.A. (1987). Comments on An Algorithm for Solving the Linear Goal-Programming Problem by Solving Its Dual. The Journal of the Operational Research Society, 38, 335-340
Dantzig, G.B., dan Wolfe, P. (1960). The decomposition principle for linear pro-grams, Journal of the Operational Research Society. vol.8 pp. 101111.
Dauer, J.P., dan Krueger, R.J. (1977). An Iterative Approach to Goal Program-ming, Journal of the Operational Research Society. Volume 28. Pp. 671681.
David, L., dan Olson. (1984). Comparison of four goal programming algorithms.
Journal of the operational research society , volume 35. pp 347354.
El-Dash., dan Mohamed. (1992). Goal Programming: Methodology and Applica-tions: Methodology and Applications. Spinger Science Business Media, New York.
89
Universitas Sumatera Utara
El-Quliti, S.A., Ragab, A.H.M., Abdelaal, R., Mohamed, A.W., Mashat, A.S., Noaman, A.Y., dan Altalhi, A.H. (2015). A Nonlinear Goal Programming Model for University Admission Capacity Planning with Modified Differential Evolution Algorithm. Mathematical Problems in Engineering. Volume 2015, Article ID 892937, 13 pages.
Evans, G.W. (1984). An overview of techniques for solving multiobjective mathe-matical programs, Management Science .vol.30 (11). pp 12681282.
Fazlollahtabar, H., Mahdavi, I., TalebiAshoori, M., Kaviani, S., Mahdavi-Amiri, N.
(2011), A multi-objective decision-making process of supplier selection and order allocation for multi-period scheduling in an electronic market, Interna-tional Journal of Advanced Manufacturing Technology, 52, 10391052
Ferland, J.A ., dan Potvin, J. (1985). Generalized Convexity and Fractional Pro-gramming with Economic Applications. Spinger Science Business Media, LLC, USA.
Flavell, R. (1976). A new goal programming formulation. Omega . vol. 4(6), pp 731-732.
Gabbani, D., dan Magazine, M. (1986). An interactive heuristic approach for multi-objective integer programming problems. Journal of the Operational Research Society. Vol. 37 (3), pp 285291.
Garrod, N. W., dan Moores, B. (1978). A Review of Goal Programming: A Tool for Multiobjective. Analysis. Journal of the Operational Research Society. Vol.29, Issue 11, pp 11091119.
Goedhart, M.H., dan Spronk, J. (1995). an interactive heuristic for financial plan-ning in decentralized organizations. European Journal of Operational Re-search. vol.86, pp 162175.
Gonzales, J.J., Reeves, G.R., dan Franz, L.S.(1993). An interactive procedure for multiple objective integer linear programming problems. Springer Verlag Berlin.
Gupta, N., Ali, I., dan Bari, A. (2013). A compromise solution for multi-objective chance constraint capacitated transportation problem. Prob Stat Forum. Vo-lume 06, Pages 6067.
Gur, S., dan Eren, T. (2018). Application of Operational Research Techniques in Operating Room Scheduling Problems: Literature Overview. Journal of Healthcare Engineering. Volume 2018, Article ID 5341394, 15 pages
Hannan, E. L. (1981). An assessment of criticism of goal programming, Computer And Operation Research. Vol.12. pp 525-541.
Hannan, M.T., dan Freeman, J.(1977). The population ecology of organizations.
American Journal of Sociology. Vol. 82, pp. 929-64.
Hooke, R., dan Jeeves, T.A. (1961). Method is a one-point direct search that attacks the step size problem. Research & Development Center Westinghouse Electric Corporation Pittsburgh.
Hwang, C.L., dan Masud, A.S.M. (1979). Multiple Objective Decision Making Methods And Applications. A State-Of-The-Art Survey. Free Preview, Spi-nger. Verlag, Berlin, Heidelberg.
91
Ignizio, J. P. (1985). An algorithm for solving the linear goal-programming problem by solving its dual. Journal of operational Research Society. Vol.36, Issue 6.
pp 507515.
Ignizio, J.P. (1976). Goal Programming and Extensions. D.C. Heath, Lexington USA.
Ignizio, J.P. (1982), Linear programming in Single and Multiple Objective System, Prentice Hall,USA.
Ijiri, Y. (1965). Management Goals and Accounting for Control, Studies in Mathe-matical. Amsterdam, North-Holland Publishing Company, 1965, vol.33 pp.
191.
Jaap, S. (1981). Interactive Multiple Goal Programming : Applications to Financial Planning. International Series in Management Science/Operations Research.
Spinger.
Jonathan, S.T., dan Evan, B.T. (1984). Heuristic and analytic processes in reason-ing. At the University of Tilburg, Holland.
Jones, D., dan Tamiz, M. (2010). Practical Goal Programming. Science Business Media, LLC. Springer, Boston.
Karaivanova, J.N., Korhonen, P., Narula, S.C., Wallenius., J., dan Vassilev, V.
(1995). A reference direction approach to multiple objective integer linear programming. European Journal of Operational Research. Vol. 81, pp , 176187.
Karaivanova, J.N., Narula, S.C., dan Vassilev, V. (1993). An interactive procedure for multiple objective integer linear programming problems. European Journal of Operational Research. Vol. 68, pp 344351.
Kaur, N., dan Tomar, V. (2015). Multi Objective Optimization Model using Pre-emptive Goal Programming for Software Component Selection. I.J. Informa-tion Technology and Computer Science. Vol. 09, pp 31-37.
Klein, D., dan Hannan, E., (1982). An algorithm for the multiple objective integer linear programming problem. European Journal of Operational Research. vol.
9, pp 378385.
Kornbluth, J., dan Steuer, M.D. (1981). Multiple objective linear fractional pro-gramming. Management Science. Vol. 27, pp. 1024-1039.
Kumar, S. (2004). A Decision Support Model for the Liner Shipping Competi-tion Policy Debate, Proceedings of the InternaCompeti-tional AssociaCompeti-tion of Maritime Economists, Panama, 1215 November.
Lee, S. M., William, R., dan Sevebeck. (1971). An aggregative model for munici-pal economic planning. Virginia Polytechnic Institute, Blacksburg, Virginia springer.
Lee, S.M. (1972). Goal Programming for Decision Analysis. Auer Bach, Philadel-phia.
Lee, S.M. (1980). ”Goal Programming for Portfolio Selection”. Journal of Portfolio Management. vol.1, pp 22-26.
Universitas Sumatera Utara
Lee, S.M. (1985). A Simple On-Line Bin-Packing Algorithm . Journal of the Asso-ciation for Computing Machinery. Vol. 32, No. 3, pp. 562-572.
Lee, S.M., dan Clayton, E. R. (1972). A goal programming model for academic resource allocation. Management Science. vol. 18, no. 8, pp. B-395B-408, Lee, S.M., dan Olson. (1985). A gradient algorithm for chance constrained nonlinear
goal programming. Applied Simulated Annealing. Springer, Berlin, Heidelberg.
Malhotra, N., dan Arora, S.R. (1999). Nonlinear Integer Goal Programming. De-partement Of Mathematics, Hans Raj College, University Of Delhi.
Mayasari, R., Mawengkang, H., dan Purba, R.G. (2018). An Interactive Strategy for Solving Multi-Criteria Decision Making of Sustainable Land Revitalization Planning Problem, IOP Conf. Series: Materials Science and Engineering. 300, 012084.
M˙ekidiche, M., Mouslim, H., dan Sahed, A. (2013). Appication of Tolerance Ap-proach to Fuzzy Goal Programming to Aggregate Production Planning. Algeria:
University of Tlemcen.
Min, H., dan Storbeck, J. (1991). On the Origin and Persistence of Misconceptions in Goal Programming. Journal of the Operational Research Society,vol. 42, pp 301-312.
Nakayama, H. (1991). Satisficing Trade-off Method for Problems with Multiple Linear Fractional Objectives and its Applications. Springer, Okamoto, Hi-gashinada, Kobe 658, Japan.
Narula, S.C., dan Vassilev, V. (1994). An interactive algorithm for solving multiple objective integer linear programming problems. European Journal of Opera-tional Research. Vol. 79, pp 443450.
Nikolaos, V., dan Sahinidis. ( 2018). Mixed-integer nonlinear programming. Opti-mization and Engineering. Springer Science+Business Media, LLC, Springer USA.
Olson., dan Lee, D. (1985). Revised simplex method of solving linear goal pro-gramming problem, Journal of the Operational Research Society. Vol. 36, pp 507-515.
Olson., dan Swenseth. (1987). A Linear Approximation for Chance-Constrained Programming. Department of Business AnalysisTexas A & M University USA. Volume 38, - Issue 3, Pages 261-267
Puntosadewo, A. (2014), The Application Of Goal Programing For Portfolio Selec-tion Problem In Indonesia. InternaSelec-tional Seminar on InnovaSelec-tion in Mathema-tics and MathemaMathema-tics Education.
Reeves, C. R. (1994). Genetic algorithms and neighbornhood search. In: Evolu-tionary Computing, T. Fogarty (Ed.). Berlin, Springer Verlag.
Ringuest, J.L. (1992). Multiobjective Optimization: Behavioral and Computational considerations. Principles and Practice. Klumer Academic Publishers.
Ringuest, J.R., dan Gulledge, T.R. (1982). An integer linear programming model of staff retention and termination based on multiattribute utility theory. Decision Sciences SanFrancisco.
93
Romero, C. (1991). Handbook on Critical Issues in Goal Programming. Pergamon Press, Oxford, England.
Ruefli, T. (1971). A generalized goal decomposition model. Management Sciences.
vol.17, pp 505518.
Saaty, T.L. (1977). Multicriteria decision making: the analytic hierarchy process.
McGraw-Hill: New York.
Saaty, T.L. (1980). The Analytical Hierarchy Process. New York, McGraw-Hill.
Saaty, T.L.(1984). Scaling method for priorities in hierarchical structures. Journal of Mathematical Psychology. Vol.15: pp 234281.
Sabera, J., dan Ravindran, S. (1993). Goal Programming: Methodology and Appli-cations. Springer Science & Business Media, LLC New York.
Sharma, H.P., dan Sharma, D.K. (2006). A Multi-Objective Decision-Making Ap-proach For Mutual Fund Portfolio. Journal of Business & Economics Re-search. Vol. 4, pp 13-24.
Steuer, R. (1977). An interactive multiple objective linear programming procedure.
In: TIMS Studies in the Management Sciences. Vol 6. Pp 225-339, North Holland.
Sweeney, E. P., Dennis, J., Roy, W.P., dan Baker, N.R. (1978). Composition vs decomposition. Management Sciences. Vol. 24, pp 1491.
Tamiz, M., dan Jones, D.F. (1996). Goal Programming and Pareto Efficiency. Jour-nal of Information and Optimization Sciences. vol. 17. pp 291-307.
Van, A., dan Nijkamp, P. (1977). A multicriteria analysis for water resource and land use development. Water Resources Research An agu journal. Volume 13, Issue 3, Pages 513-518.
Villareal, B., dan Karwan, M. H. (1981). An interactive dynamic programming approach to multi criteria discrete programming. J.Math. Anal. Appl. Vol.81, pp 524-544.
Vitoriano., dan Romero, C. (1994). Extended interval goal programming. Journal of the Operational Research Society. vol.50:12, pp 1280-1283
Xu, C., dan Zhang, J. (2010). Inverse optimization for linearly constrained convex separable programming problems. European Journal of Operational Research.
vol.200; pp.671-679.
Yang, C., Zhang, J., dan Ma, Z. (2007). Inverse maximum flow and minimum cut problems. A Journal of Mathematical Programming and Operations Research.
Vol. 40(2). pp 147-170.
Zhang, J., dan Liu, Z. (1996). Calculating some inverse linear programming prob-lems. Jounal Computer Applied Mathematic. Vol.72, pp 261-273.
Universitas Sumatera Utara