Pollard, JP

The subroutine SOK solves a set of N simultaneous linear equations by an essentially iterative method. For the method to converge at a reasonable rate (or at all) the user must choose K(

kwee, theam

Bachelor's / BACHELOR OF SCIENCE (ESTATE MANAGEMENT)

soke yin, brigid chan

Bachelor's / BACHELOR OF SCIENCE (ESTATE MANAGEMENT)

Darte, Alain Vivien, Frédéric

In this paper, we compare three nested loops parallelization algorithms (Allen and Kennedy's algorithm, Wolf and Lam's algorithm and Darte and Vivien's algorithm) that use different representations of distance vectors as input. We identify the concepts that make them similar or different. We study the optimality of each with respect to the dependen...

Senne, Edson Luiz França Lucas, Cormac Taylor, Simon

The increase of computing power of the microcomputers has stimulated the building of direct manipulation interfaces that allow graphical representation of Linear Programming (LP) models. This work discusses the components of such a graphical interface as the basis for a system to assist users in the process of formulating LP problems. In essence, t...

Senne, Edson Luiz França Lucas, Cormac Taylor, Simon

The increase of computing power of the microcomputers has stimulated the building of direct manipulation interfaces that allow graphical representation of Linear Programming (LP) models. This work discusses the components of such a graphical interface as the basis for a system to assist users in the process of formulating LP problems. In essence, t...

Senne, Edson Luiz França Lucas, Cormac Taylor, Simon

The increase of computing power of the microcomputers has stimulated the building of direct manipulation interfaces that allow graphical representation of Linear Programming (LP) models. This work discusses the components of such a graphical interface as the basis for a system to assist users in the process of formulating LP problems. In essence, t...

Senne, Edson Luiz França Lucas, Cormac Taylor, Simon

The increase of computing power of the microcomputers has stimulated the building of direct manipulation interfaces that allow graphical representation of Linear Programming (LP) models. This work discusses the components of such a graphical interface as the basis for a system to assist users in the process of formulating LP problems. In essence, t...

Nunez, Manuel A. Freund, Robert M.
Published in
Mathematical Programming

Given a data instanced=(A, b, c) of a linear program, we show that certain properties of solutions along the central trajectory of the linear program are inherently related to the condition number C(d) of the data instanced=(A, b, c), where C(d) is a scale-invariant reciprocal of a closely-related measure ρ(d) called the “distance to ill-posedness”...

Gülpinar, Nalân Mitra, Gautam Maros, Istvan
Published in
Top

Recently, linear programming problems with special structures have assumed growing importance in mathematical programming. It is well known that exploiting network structures within linear programs can lead to considerable improvement of the computational solution of large-scale linear programming problems. A linear program is said to contain an em...