Pascal Subroutines for Solving Some Problems in Interval LP
Frantisek Mraz, Martin Kursch, Daniel Panuska · Zenodo (CERN European Organization for Nuclear Research) · 1998
Abstract: This paper deals with the Pascal subroutines for solving certain problems in the interval linear programming, especially with calculating the exact range, i.e. the supremum and the in mum of optimal objective function values of a family of LP problems in which all coe cients in constraints vary in given intervals. A theoretical background of the algorithms and a description of the package is included. An application of algorithms regarding a set of feasible coe cients and the solvability set is described in this paper and numerical experiences are also mentioned. Key words: linear programming problem, inexact data, interval coe cients, Pascal subroutines.