z-logo
open-access-imgOpen Access
Modifying the forrest-tomlin and saunders updates for linear programming problems with variable upper bounds
Author(s) -
Mike Todd
Publication year - 1986
Publication title -
annals of operations research
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.068
H-Index - 105
eISSN - 1572-9338
pISSN - 0254-5330
DOI - 10.1007/bf02022088
Subject(s) - theory of computation , basis (linear algebra) , variable (mathematics) , inverse , mathematics , simplex algorithm , representation (politics) , core (optical fiber) , matrix (chemical analysis) , linear programming , triangular matrix , upper and lower bounds , computer science , mathematical optimization , algorithm , discrete mathematics , pure mathematics , mathematical analysis , telecommunications , materials science , geometry , politics , political science , law , composite material , invertible matrix

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom