The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.

## Filters

##
###
Page 5236 of Mathematical Reviews Vol. , Issue 93i
[page]

1993
*
Mathematical Reviews
*

The author proposes

*a*path-following*algorithm**for**a*certain class of*monotone*variational inequalities. ... Juidice (P-CMBR) 93i:90098 90C33 49340 Tseng, P. (1-WA) Global*linear*convergence of*a*path-following*algorithm**for*some*monotone*variational inequality problems. (English summary) J. Optim. ...##
###
Page 724 of Mathematical Reviews Vol. , Issue 97A
[page]

1997
*
Mathematical Reviews
*

*For*convex generalized

*fractional*

*programs*

*a*new dual problem is introduced and an

*algorithm*

*for*solving this problem is suggested. ... |Zhang, Shu Zhong] (NL-ROTT-EM; Rotterdam)

*A*new

*algorithm*

*for*generalized

*fractional*

*programs*. (English summary) Math.

*Programming*72 (1996), no. 2, Ser.

*A*, 147-175. ...

##
###
Page 1239 of Mathematical Reviews Vol. , Issue 96b
[page]

1996
*
Mathematical Reviews
*

In addition an error bound

*for*the non-degenerate case is also proved.*A*sequential*linear**programming**algorithm**for*solving*a*non-*monotone*problem is also presented. ... The*programs*under consideration consist of minimizing the maximum of*a*fi- nite number of*linear**fractions*over some convex set. ...##
###
Page 5550 of Mathematical Reviews Vol. , Issue 88j
[page]

1988
*
Mathematical Reviews
*

Summary: “We present

*a*finite*algorithm**for*solving the bilinear*programming*problem by reducing it to*a*concave minimization problem. ...*For**a*certain class of functions, the complexity of this*algorithm*is shown to be either*linear*in the number of functions, or at least squared in that number.” 90 ECONOMICS, OPERATIONS RESEARCH,*PROGRAMMING*...##
###
Page 3445 of Mathematical Reviews Vol. , Issue 2004d
[page]

2004
*
Mathematical Reviews
*

Levy (1-BOWD; Brunswick, ME)
2004d:90106 90C32
Nguyen Thi Hoai Phuong (VN-HMI; Hanoi) ;
Hoang Tuy (VN-HMI; Hanoi)

*A*unified*monotonic*approach to generalized*linear**fractional**programming*. ... The main result is applied to the stability analysis of*a*nonlinear*program*with*linear*constraints. Adam B. ...##
###
The RPR 2 Rounding Technique for Semidefinite Programs
[chapter]

2001
*
Lecture Notes in Computer Science
*

We present

doi:10.1007/3-540-48224-5_18
fatcat:xmmnchn2kjcm7ltgzanblosvou
*a*procedure called RP R 2 (Random*Projection*followed by Randomized Rounding)*for*rounding the solution of such semidefinite*programs*. ... Several combinatorial optimization problems can be approximated using*algorithms*based on semidefinite*programming*. ...*A*common method*for*obtaining an approximation*algorithm**for**a*combinatorial optimization problem is based on*linear**programming*: 1. Formulate the problem as an integer*linear**program*. 2. ...##
###
Page 1173 of Mathematical Reviews Vol. , Issue 92b
[page]

1992
*
Mathematical Reviews
*

Rosen, The gradient

*projection*method*for*nonlin- ear*programming*. I.*Linear*constraints [MR 22 #3601] (pp. 1-37); J. B. Rosen, The gradient*projection*method*for*nonlinear pro- gramming. II. ... We obtain the domain of attraction of the*algorithm*.” 92b:90206 90C30 90-06 * Gradient*projection*method in*linear*and nonlinear*programming*. Edited by Ding Zhu Du. ...##
###
Page 6462 of Mathematical Reviews Vol. , Issue 2003h
[page]

2003
*
Mathematical Reviews
*

*a*

*linear*

*fractional*function.” 2003h:90090 90032 90C46 Chen, Xiuhong (PRC-HYTC; Huaiyin) Optimality and duality

*for*the multiobjective

*fractional*

*programming*with the generalized (F, ») convexity. ... (PRC-CHK; Kowloon) ; Xiu, Naihua (PRC-NJT-AM; Beijing) New

*projection*-type methods

*for*

*monotone*LCP with finite termination. ...

##
###
Page 3351 of Mathematical Reviews Vol. , Issue 97E
[page]

1997
*
Mathematical Reviews
*

or

*a**linear**fractional*function. ... Discrete Math. 5 (1979), 3 51] we generate cuts to solve disjunctive interval*linear*or*linear**fractional**programming*of the form max / (x) subject to*a*< Ax < b, xxx; =0, k # j, where f(x) is*a**linear*...##
###
Page 7474 of Mathematical Reviews Vol. , Issue 98K
[page]

1998
*
Mathematical Reviews
*

Chapter 3 introduces the reader to the

*linear**fractional**program*- ming problem. ... Finally, in Chapter 10 the*fractional*transportation problem having*a**linear**fractional*objective function is studied. ...##
###
An Effective Branch and Bound Algorithm for Minimax Linear Fractional Programming

2014
*
Journal of Applied Mathematics
*

An effective branch and bound

doi:10.1155/2014/160262
fatcat:cnh7wmbm3vfsxmokli6pvetifi
*algorithm*is proposed*for*globally solving minimax*linear**fractional**programming*problem (MLFP). ... In this*algorithm*, the lower bounds are computed during the branch and bound search by solving*a*sequence of*linear*relaxation*programming*problems (LRP) of the problem (MLFP), which can be derived by ... Acknowledgments This paper is supported by the National Natural Science Foundation of China under Grant (11171094) and the Science and Technology Key*Project*of Education Department of Henan Province ( ...##
###
Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality

1994
*
SIAM journal on computing (Print)
*

The problem of computing

doi:10.1137/s0097539793251876
fatcat:4b7fuvt7arhkdhpsuusigyrpci
*a*feasible solution in the*linear*(or*fractional*) case has been investigated extensively. ... Shostak [18] suggested that*a**linear**program*with two variables per inequality can be represented as*a*graph" since each inequality contains two variables, one can represent the*linear**program*by*a*graph ...*A**linear**program*with two variables per inequality is called*monotone*if*for*every inequality, the coefficients of the two variables have opposite signs. ...##
###
Page 2903 of Mathematical Reviews Vol. , Issue 93e
[page]

1993
*
Mathematical Reviews
*

The authors develop

*a*path-following*algorithm**for*solving*linear**programs*and show that it has*a*polynomial property. Solution schemes are given*for*both the primal and the dual problems. ... (CH-GENV-ID)*A*polynomial method of approximate centers*for**linear**programming*. Math.*Programming*54 (1992), no. 3, Ser.*A*, 295-305. ...##
###
Page 874 of Mathematical Reviews Vol. 45, Issue 3
[page]

1973
*
Mathematical Reviews
*

Decomposition

*algorithms**for*solving large structure*linear**fractional**programs*, and*for*parametic*linear*ECONOMICS, OPERATIONS RESEARCH,*PROGRAMMING*, GAMES cedure given in the literature. ... Grigoriadis, Michael D. 4826*A**projective*method*for*structured nonlinear*programs*. Math.*Programming*1 (1971), 321-358. ...##
###
Page 1881 of Mathematical Reviews Vol. , Issue 95c
[page]

1995
*
Mathematical Reviews
*

Summary: “The

*algorithm*described in this paper approaches the optimal solution of*a*continuous semi-infinite*linear**programming*problem through*a*sequence of basic feasible solutions. ... In this paper the authors develop*a*Lagrangian duality theory*for*the following nondifferentiable generalized*fractional**programming*problem involving n-set functions: (P) inf max F;(S,,---,Sn)/Gi(Si,- ...
« Previous

*Showing results 1 — 15 out of 28,794 results*