Amanote Research
Register
Sign In
Eliminating Columns in the Simplex Method for Linear Programming
doi 10.2172/5761063
Full Text
Open PDF
Abstract
Available in
full text
Date
November 1, 1987
Authors
Yinyu Ye
Publisher
Office of Scientific and Technical Information (OSTI)
Related search
The Simplex Method for Quadratic Programming
Econometrica
Economics
Econometrics
QoS Routing in Communication Networks: Approximation Algorithms Based on the Primal Simplex Method of Linear Programming
IEEE Transactions on Computers
Hardware
Architecture
Mathematics
Computational Theory
Theoretical Computer Science
Software
The Steepest Descent Gravitational Method for Linear Programming
Discrete Applied Mathematics
Combinatorics
Applied Mathematics
Discrete Mathematics
A Simplex Algorithm---Gradient Projection Method for Nonlinear Programming
A Linear Programming Decomposition Focusing on the Span of the Nondegenerate Columns
European Journal of Operational Research
Information Systems
Simulation
Management Science
Management
Computer Science
Modeling
Operations Research
Bounded Primal Simplex Algorithm for Bounded Linear Programming With Fuzzy Cost Coefficients
International Journal of Operations Research and Information Systems
Analysis for Distributed Cooperation Based on Linear Programming Method
A Novel Method for Solving the Fully Fuzzy Bilevel Linear Programming Problem
Mathematical Problems in Engineering
Mathematics
Engineering
An Alternating Method for Stochastic Linear Programming With Simple Recourse
Stochastic Programming 84 Part I
