ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    A projection method for the uncapacitated facility location problem (1990)
    Springer
    Mathematical programming 46 (1990), S. 273-298 
    Details
    ISSN: 1436-4646
    Keywords: Location ; projection methods ; computational study
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Several algorithms already exist for solving the uncapacitated facility location problem. The most efficient are based upon the solution of the strong linear programming relaxation. The dual of this relaxation has a condensed form which consists of minimizing a certain piecewise linear convex function. This paper presents a new method for solving the uncapacitated facility location problem based upon the exact solution of the condensed dual via orthogonal projections. The amount of work per iteration is of the same order as that of a simplex iteration for a linear program inm variables and constraints, wherem is the number of clients. For comparison, the underlying linear programming dual hasmn + m + n variables andmn +n constraints, wheren is the number of potential locations for the facilities. The method is flexible as it can handle side constraints. In particular, when there is a duality gap, the linear programming formulation can be strengthened by adding cuts. Numerical results for some classical test problems are included.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01585746
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Foreword (1990)
    Springer
    Mathematical programming 48 (1990), S. vii 
    Details
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01582248
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    A network penalty method (1991)
    Springer
    Mathematical programming 50 (1991), S. 53-73 
    Details
    ISSN: 1436-4646
    Keywords: Network flows ; penalty functions ; network simplex
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We consider the minimum cost network flow problem and describe how the non-linear penalty function methods of Conn and Bartels can be specialized to a combinatorial algorithm for this problem. We report on preliminary computational results which show that this method can require fewer pivots than the simplex method while the amount of work required for each pivot is comparable. The algorithm can be proven finite using a modification of Cunningham's strongly feasible basis pivoting rule.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01594924
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    Convergence of quasi-Newton matrices generated by the symmetric rank one update (1991)
    Springer
    Mathematical programming 50 (1991), S. 177-195 
    Details
    ISSN: 1436-4646
    Keywords: Quasi-Newton updates ; convergence theory
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Quasi-Newton algorithms for unconstrained nonlinear minimization generate a sequence of matrices that can be considered as approximations of the objective function second derivatives. This paper gives conditions under which these approximations can be proved to converge globally to the true Hessian matrix, in the case where the Symmetric Rank One update formula is used. The rate of convergence is also examined and proven to be improving with the rate of convergence of the underlying iterates. The theory is confirmed by some numerical experiments that also show the convergence of the Hessian approximations to be substantially slower for other known quasi-Newton formulae.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01594934
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 5
    Electronic Resource
    Electronic Resource
    A note on exploiting structure when using slack variables (1994)
    Springer
    Mathematical programming 67 (1994), S. 89-97 
    Details
    ISSN: 1436-4646
    Keywords: 65K05 ; 90C30 ; Large-scale problems ; Nonlinear optimization ; Numerical algorithms ; Slack variables ; Augmented Lagrangian
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We show how to exploit the structure inherent in the linear algebra for constrained nonlinear optimization problems when inequality constraints have been converted to equations by adding slack variables and the problem is solved using an augmented Lagrangian method.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01582214
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...