Author:
El-Banna Abou-Zaid H.,Zarea Sana’a A.
Subject
Applied Mathematics,Modeling and Simulation,Numerical Analysis,General Computer Science,Theoretical Computer Science
Reference8 articles.
1. M. Balnaski, An algorithm for finding all vertices of convex polyhedral sets, J. Soc. Industrial Appl. Math. (1961) 72–88.
2. A. El-Banna, A study on a class of parametric multiobjective convex programming problems, in: Proceedings of the 9th Symposium of Operation Research, Germany, 27–29 August 1984.
3. A. El-Banna, On multiobjective convex programs using the extensior of generalized Tchebycheff norm, Advances in Modelling & Analysis, Vol. 14, No. 2, AMS Press, 1993, pp. 43–48.
4. C. Hwang, A. Mosud, Multiple in Parametric Decision Making Methods and Application, Spring, Berlin, 1979.
5. Qualitative analysis of basic notations in parametric convex programming (II) (parameters in the objective function);Osman;Appl. Math.,1977
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Nonlinear Multiobjective Programming;Wiley Encyclopedia of Operations Research and Management Science;2011-02-15
2. A concept of a robust solution of a multicriterial linear programming problem;Central European Journal of Operations Research;2010-11-09
3. Computing the tolerances in multiobjective linear programming;Optimization Methods and Software;2008-10