๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Optimum cutting out of glass by linear programming method

โœ Scribed by V. M. Nikulin; L. T. Khizhnyak; S. Z. Oganezova; L. S. Vinarik

Book ID
104879304
Publisher
Springer US
Year
1965
Tongue
English
Weight
305 KB
Volume
22
Category
Article
ISSN
0361-7610

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The solution of linear interval equation
The solution of linear interval equations by a linear programming method
โœ Oliver Aberth ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 556 KB

A method is described for solving a system of n linear equations in n unknowns when the coefficients and constants of the equations are specified as intervals. Here a solution is considered to be the supplying of optimal interval bounds for the unknowns. Even for small n, such systems of interval eq

Solving convex programs with infinitely
Solving convex programs with infinitely many linear constraints by a relaxed cutting plane method
โœ Soon-Yi Wu; S.-C. Fang ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 541 KB

One of the major computational bottlenecks of using the conventional cutting plane approach to solve convex programming problems with infinitely many linear constraints lies in finding a global optimizer of a nonlinear and nonconvex program. This paper presents a relaxed scheme to generate a new cut