#### Filter Results:

- Full text PDF available (7)

#### Publication Year

1967

2015

- This year (0)
- Last 5 years (2)
- Last 10 years (4)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

This paper gives an algorithm for L-shaped linear programs which arise naturally in optimal control problems with state constraints and stochastic linear programs (which can be represented in this form with an infinite number of linear constraints). The first section describes a cutting hyperplane algorithm which is shown to be equivalent to a partial… (More)

- Richard M. Van Slyke, Howard Frank
- Networks
- 1971

- Gavriel Yarmish, Richard M. Van Slyke
- The Journal of Supercomputing
- 2008

We present a simple, scaleable, distributed simplex implementation for large linear programs. It is designed for coarse-grained computation, particularly, readily available networks of workstations. Scalability is achieved by using the standard form of the simplex rather than the revised method. Virtually all serious implementations are based on the revised… (More)

- Howard Frank, Ivan T. Frisch, Richard M. Van Slyke, Wushow Chou
- Networks
- 1971

Major design probZems for centraZized computer networks are link Zayout and capacity assignment. The objective is to seZect link Zocations and capacities so that the average time deZay required to transmit a message from any node to the centraZ node does not exceed a specified maximum. The design probtem is to find the Zeast cost system which satisfies the… (More)

- Aaron Kershenbaum, Richard M. Van Slyke
- Networks
- 1973

- George B. Dantzig, Richard M. Van Slyke
- J. Comput. Syst. Sci.
- 1967

A variant of the revised simplex method is given for solving linear programs with 5 I + L equations, L of which have the property that each variable has at most one nonzero coefficient in them. Special cases include transportation problems, programs with upper bounded variables, assignment and weighted distribution problems. The algorithm described uses a… (More)

This paper uses probability models on expansive wavelet transform coefficients with interpolation constraints to estimate missing blocks in images. We use simple probability models on wavelet coefficients to formulate the estimation process as a linear programming problem and solve it to recover the missing pixels. Our formulation is general and can be… (More)

- Howard Frank, Israel Gitman, Richard M. Van Slyke
- AFIPS National Computer Conference
- 1975

The Packet Radio System considered as a network is characterized by devices, terminals, repeaters and stations, linked together by broadcast radio channels.

- Richard Van Slyke, Howard Frank
- WSC '71
- 1971

A major consideration in the original design and in the expansion of any computer-communication network is the provision of a network which will be relatively invulnerable to failures of its components. This paper considers the reliability analysis of such networks. Two indices of reliability for a network are introduced. Methods for the calculation of… (More)

Yarmish & Van Slyke 2002, 2003 October 5, 2003 retroLP, AN IMPLEMENTATION OF THE STANDARD SIMPLEX METHOD Gavriel Yarmish, Brooklyn College (gyarmish@photon.poly.edu), and Richard Van Slyke, Polytechnic University (rvslyke@poly.edu)