Method of centers for generalized fractional programming (Q5925737): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / review text | |||
The following generalized fractional programming problem is considered: \[ \underset{x\in X}{\text{Inf}}\Bigl\{\max_{i\in I}\bigl[ f_i(x)/ g_i(x)\bigr] \Bigr\} \] where \(I=\{1,\dots,m\}\), \(X=\{x\in R|h_j(x)\leq 0\), \(1\leq j\leq p\}\). It is assumed thta \(X\neq\emptyset,f,g\) are continuous functions on \(X\) and \(g_i(x)>0\) for all \(x\in X\), and \(i\in I\). The author proposes an algorithm to solve this problem. The algorithm is a combination of a parametric approach and the Huard method of centers. The solution is obtained by solving a sequence of unconstrained optimization problems. A dual problem to the generalized fractional programming problem with linear functions \(f_i\) and \(g_i\) is studied and the results of some numerical tests are presented. | |||
| Property / review text: The following generalized fractional programming problem is considered: \[ \underset{x\in X}{\text{Inf}}\Bigl\{\max_{i\in I}\bigl[ f_i(x)/ g_i(x)\bigr] \Bigr\} \] where \(I=\{1,\dots,m\}\), \(X=\{x\in R|h_j(x)\leq 0\), \(1\leq j\leq p\}\). It is assumed thta \(X\neq\emptyset,f,g\) are continuous functions on \(X\) and \(g_i(x)>0\) for all \(x\in X\), and \(i\in I\). The author proposes an algorithm to solve this problem. The algorithm is a combination of a parametric approach and the Huard method of centers. The solution is obtained by solving a sequence of unconstrained optimization problems. A dual problem to the generalized fractional programming problem with linear functions \(f_i\) and \(g_i\) is studied and the results of some numerical tests are presented. / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Karel Zimmermann / rank | |||
Normal rank | |||
Revision as of 17:37, 21 December 2023
scientific article; zbMATH DE number 1566523
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Method of centers for generalized fractional programming |
scientific article; zbMATH DE number 1566523 |
Statements
Method of centers for generalized fractional programming (English)
0 references
19 February 2001
0 references
fractional programs
0 references
parametric methods
0 references
method of centers
0 references
rate of convergence
0 references
The following generalized fractional programming problem is considered: \[ \underset{x\in X}{\text{Inf}}\Bigl\{\max_{i\in I}\bigl[ f_i(x)/ g_i(x)\bigr] \Bigr\} \] where \(I=\{1,\dots,m\}\), \(X=\{x\in R|h_j(x)\leq 0\), \(1\leq j\leq p\}\). It is assumed thta \(X\neq\emptyset,f,g\) are continuous functions on \(X\) and \(g_i(x)>0\) for all \(x\in X\), and \(i\in I\). The author proposes an algorithm to solve this problem. The algorithm is a combination of a parametric approach and the Huard method of centers. The solution is obtained by solving a sequence of unconstrained optimization problems. A dual problem to the generalized fractional programming problem with linear functions \(f_i\) and \(g_i\) is studied and the results of some numerical tests are presented.
0 references
