Ograniczanie wyników
Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 1

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  second order convex function
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
EN
An approach to nonlinear constrained mathematical programming problems which makes use of a second order derivative is presented. By using a second order modified objective function method, a modified optimization problem associated with a primal mathematical programming problem is constructed. This auxiliary optimization problem involves a second order approximation of an objective function constituting the primal mathematical programming problem. The equivalence between the original mathematical programming problem and its associated modified optimization problem is established under second order convexity assumption. Several practical O.R. applications show that our method is efficient. Further, an iterative algorithm based on this approach for solving the considered nonlinear mathematical programming problem is given for the case when the functions constituting the problem are second order convex. The convergence theorems for the presented algorithm are established.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.