Opening book details…
About this book
A quadradically-convergent algorithm for the linear programming problem with lower and upper bounds by Coleman, Thomas F. 1950- is a book available to read on EtoBox.
- Author
- Coleman, Thomas F. 1950-
- Publisher
- Cornell Theory Center, Cornell University, 1990.
- Published
- 1990
- Language
- EN
More by Coleman, Thomas F. 1950-
Browse all works by Coleman, Thomas F. 1950-
Similar books
- Upper and Lower Bounds for Tunneling Splittings in a Symmetric Double-well Potential — Miklos Ronto & Eli Pollak
- The Dual Method of Solving the Linear Programming Problem. — Carlton E. Lemke (1953)
- Upper and Lower Bounds for Quadratic Integrals, and at a Point, for Solutions of Linear Boundary Value Problems — Diaz, J. B. 1920- (1959)
- Rapid Determination of Upper and Lower Bounds to Buckling Loads and Natural Frequencies of Non-uniform Bars — Alostaz, Mohammad Jasem. (1984)
- Solving Multi-objective Linear Fractional Programming Problem Utilizing ($$\alpha , \beta )$$-Cut in Triangular Intuitionistic Fuzzy Setup — Rakesh Kumar Bajaj; Saurabh Srivastava; Abhishek Guleria (2022)
- Overview of Optimization Tools for Ready-Mixed Concrete Dispatching Problem Based on Mixed-Integer Linear Programming — Mateja Držečnik; Uroš Klanšek (2023)