Computational mathematical programming

Computational mathematical programming

4.11 - 1251 ratings - Source

An implicit enumeration procedure for the general linear complementarity problem. Recursive quadratic programming methods based on the augmented lagrangian. A primal truncated newton algorithm with application to large-scale nonlinear network optimization. Approximating some convez programs in terms of borel fields. Computer-assisted analysis for diagnosing infeasible or unbounded linear programs. Ventura, restricted simplicial decomposition: computation and extensions.A note solution on approach to linear programming problems with imprecise function and gradient values. Z; a maany, a new algorithm for highly curved constrained optimization. An implementation of an algorithm for univariate minimization and an application to nested optimization. On practical stopping rules for the simplex method. An experimental approach to karmarkar's projective method for linear programming.Karla L. Hoffman, Mathematical Programming Society (U.S.). ... Acknowledgement The author is grateful to Mr. Balaji Ramarao for coding the algorithm, generating some of the test ... References [1] F.A. Al-Khayyal, aquot;Jointly constrained bilinear programming and related problems, aquot; Industrial and Systems Engineering Report Series No. ... [6] R.W. Cottle and G.B. Dantzig, aquot; Complementary pivot theory of mathematical programming, aquot; Linear Algebra and Its Applications 1 (1968) 103-125.

Title:Computational mathematical programming
Author:Karla L. Hoffman, Mathematical Programming Society (U.S.). Committee on Algorithms
Publisher:Elsevier Science Ltd - 1987


You Must CONTINUE and create a free account to access unlimited downloads & streaming