A new linear programming algorithm is proposed which has significant advantages compared to a traditional simplex method. A search direction is generated along a common edge of the active constraint set. This direction is followed in order to identify candidate constraints and to modify the current basis. The dimension of the basis matrix begins with a single element and dynamically increases but remains less than or equal to the number of design variables. This is true regardless of the number of inequality constraints present including upper and lower bounds. The proposed method can operate equally well from a feasible or infeasible point. The pivot operation and artificial variable strategy of the simplex method are not used. Examples are presented and results are compared to those generated by a traditional revised simplex algorithm. Extensions are presented for both exterior and interior versions of the approach.
Skip Nav Destination
Article navigation
June 1990
Research Papers
A New Dynamic Basis Algorithm for Solving Linear Programming Problems for Engineering Design
Y. Wang,
Y. Wang
School of Mechanical Engineering, Purdue University, West Lafayette, IN 47907
Search for other works by this author on:
E. Sandgren
E. Sandgren
School of Mechanical Engineering, Purdue University, West Lafayette, IN 47907
Search for other works by this author on:
Y. Wang
School of Mechanical Engineering, Purdue University, West Lafayette, IN 47907
E. Sandgren
School of Mechanical Engineering, Purdue University, West Lafayette, IN 47907
J. Mech. Des. Jun 1990, 112(2): 208-214 (7 pages)
Published Online: June 1, 1990
Article history
Received:
May 1, 1989
Online:
June 2, 2008
Citation
Wang, Y., and Sandgren, E. (June 1, 1990). "A New Dynamic Basis Algorithm for Solving Linear Programming Problems for Engineering Design." ASME. J. Mech. Des. June 1990; 112(2): 208–214. https://doi.org/10.1115/1.2912594
Download citation file:
Get Email Alerts
Cited By
Related Articles
A Sequential Linear Programming Coordination Algorithm for Analytical Target Cascading
J. Mech. Des (February,2010)
A Note on the Convergence of Analytical Target Cascading With Infinite Norms
J. Mech. Des (March,2010)
An Adaptive Sequential Linear Programming Algorithm for Optimal Design Problems With Probabilistic Constraints
J. Mech. Des (February,2007)
A Linear Programming Solution for Exact Collision Detection
J. Comput. Inf. Sci. Eng (March,2005)
Related Proceedings Papers
Related Chapters
Free Search and Differential Evolution towards Dimensions Number Change
Intelligent Engineering Systems through Artificial Neural Networks, Volume 16
Linear Programming
Engineering Optimization: Applications, Methods, and Analysis
A Method for Reducing the Number of Training Samples in KNN Text Classification
International Conference on Information Technology and Computer Science, 3rd (ITCS 2011)