Selected Topics in Operations Research and Mathematical Economics : Proceedings of the 8th Symposium on Operations Research, Held at the University of Karlsruhe, West Germany August 22-25, 1983

G. Hammer

ISBN 10: 3540129189 / ISBN 13: 9783540129189

Edité par Springer, Springer Vieweg, 1984

A propos de cet article

Druck auf Anfrage Neuware - Printed after ordering - Let eRN be the usual vector-space of real N-uples with the usual inner product denoted by (. , ). In this paper P is a nonempty compact polyhedral set of mN, f is a real-valued function defined on (RN continuously differentiable and fP is the line- ly constrained minimization problem stated as : min (f(x) I x EUR P) - For computing stationary points of problemtj) we propose a method which attempts to operate within the linear-simplex method structure. This method then appears as a same type of method as the convex-simplex method of Zangwill [6]. It is however, different and has the advantage of being less technical with regards to the Zangwill method. It has also a simple geometrical interpretation which makes it more under standable and more open to other improvements. Also in the case where f is convex an implementable line-search is proposed which is not the case in the Zangwill method. Moreover, if f(x) = (c,x) this method will coincide with the simplex method (this is also true in the case of the convex simplex method) i if f(x) = I Ixl 12 it will be almost the same as the algorithm given by Bazaraa, Goode, Rardin [2].

N° de réf. du vendeur 9783540129189

Détails bibliographiques

• Titre: Selected Topics in Operations Research and Mathematical Economics : Proceedings of the 8th Symposium on Operations Research, Held at the University of Karlsruhe, West Germany August 22-25, 1983
• Éditeur: Springer, Springer Vieweg
• Date de parution: 1984
• Langue: anglais
• ISBN à 10 chiffres: 3540129189
• ISBN à 13 chiffres: 9783540129189
• Reliure: Taschenbuch
• État de l'article: Neu
• Dimensions: 244 L x 170 H x 27 P (en millimètres) 244 millimètres de largeur par 170 millimètres de hauteur par 27 millimètres de profondeur
• Poids: 848 grammes

A propos de ce titre

Synopsis

Let eRN be the usual vector-space of real N-uples with the usual inner product denoted by (., . ). In this paper P is a nonempty compact polyhedral set of mN, f is a real-valued function defined on (RN continuously differentiable and fP is the line- ly constrained minimization problem stated as: min (f(x) I x P) - For computing stationary points of problemtj) we propose a method which attempts to operate within the linear-simplex method structure. This method then appears as a same type of method as the convex-simplex method of Zangwill [6]. It is however, different and has the advantage of being less technical with regards to the Zangwill method. It has also a simple geometrical interpretation which makes it more under- standable and more open to other improvements. Also in the case where f is convex an implementable line-search is proposed which is not the case in the Zangwill method. Moreover, if f(x) = (c, x) this method will coincide with the simplex method (this is also true in the case of the convex simplex method) i if f(x) = I Ixl 12 it will be almost the same as the algorithm given by Bazaraa, Goode, Rardin [2].