Geodesic
Of an Iterative Procedure for Solving the Optimization Problem into an Ellipsoid
For solving the problem of optimization in a space limited by an ellipsoid and a linear goal function, for which the maximum is searched, there is an iterative procedure suggested. The procedure starts from an interior point of the ellipsoid and by moving into its interior there is a generated sequence of points of the contour of the ellipsoid that converges to the optimal solution (point), where the goal function is of greatest value
Classification : 49J99 
@article{VM_2002_4_1_a17,
     author = {Liljana Stefanovska and Beti Andonovic and Sonja Gegovska-Zajkova},
     title = {Of an {Iterative} {Procedure} for {Solving} the {Optimization} {Problem} into an {Ellipsoid}},
     journal = {Visual Mathematics},
     publisher = {mathdoc},
     volume = {4},
     number = {1},
     year = {2002},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/VM_2002_4_1_a17/}
}
TY  - JOUR
AU  - Liljana Stefanovska
AU  - Beti Andonovic
AU  - Sonja Gegovska-Zajkova
TI  - Of an Iterative Procedure for Solving the Optimization Problem into an Ellipsoid
JO  - Visual Mathematics
PY  - 2002
VL  - 4
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/VM_2002_4_1_a17/
LA  - en
ID  - VM_2002_4_1_a17
ER  - 
%0 Journal Article
%A Liljana Stefanovska
%A Beti Andonovic
%A Sonja Gegovska-Zajkova
%T Of an Iterative Procedure for Solving the Optimization Problem into an Ellipsoid
%J Visual Mathematics
%D 2002
%V 4
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/VM_2002_4_1_a17/
%G en
%F VM_2002_4_1_a17
Liljana Stefanovska; Beti Andonovic; Sonja Gegovska-Zajkova. Of an Iterative Procedure for Solving the Optimization Problem into an Ellipsoid. Visual Mathematics, Tome 4 (2002) no. 1. http://geodesic.mathdoc.fr/item/VM_2002_4_1_a17/