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

Polaroids: A new tool in non-convex and in integer programming

โœ Scribed by Claude-Alain Burdet

Publisher
John Wiley and Sons
Year
1973
Tongue
English
Weight
522 KB
Volume
20
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A theorem in convex programming
A theorem in convex programming
โœ William Karush ๐Ÿ“‚ Article ๐Ÿ“… 1959 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 558 KB

## System Develofiment Corporation S a n t a Monica, California An optimization problem which frequently a r i s e s in applications of mathematical programming is the following: t fn (xn)l , A 5x1' . . . Lx, 5 B where f i a r e convex functions. In this paper, the function F i s studied and show

A finiteness proof for modified dantzig
A finiteness proof for modified dantzig cuts in integer programming
โœ V. J. Bowman Jr.; G. L. Nemhauser ๐Ÿ“‚ Article ๐Ÿ“… 1970 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 234 KB

where R is the index set associated with the nonbasic variables. If all of the variables are constrained to be nonnegative integers and xu is not an integer in the basic solution, the linear constraint is implied. We prove that including these "cuts" in a specified way yields a finite dual simplex a