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
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 : mi...
Gespeichert in:
| Weitere Verfasser: | , |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Berlin, Heidelberg
Springer Berlin Heidelberg
1984
|
| Ausgabe: | 1st ed. 1984 |
| Schriftenreihe: | Lecture Notes in Economics and Mathematical Systems
226 |
| Schlagworte: | |
| Online-Zugang: | DE-634 URL des Erstveröffentlichers |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | 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] |
|---|---|
| Beschreibung: | 1 Online-Ressource (X, 482 p) |
| ISBN: | 9783642455674 |
| DOI: | 10.1007/978-3-642-45567-4 |