Ranking of vertices in the linear fractional programming problem
- 1 September 1983
- journal article
- review article
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 23 (3) , 403-405
- https://doi.org/10.1007/bf01934470
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Bicriteria linear fractional programmingJournal of Optimization Theory and Applications, 1982
- A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral SetsMathematics of Operations Research, 1980
- Decomposed enumeration of extreme points in the linear programming problemBIT Numerical Mathematics, 1975
- Solving the Fixed Charge Problem by Ranking the Extreme PointsOperations Research, 1968
- Seven Kinds of ConvexitySIAM Review, 1967
- A Linear Programming Approach to the Cutting Stock Problem—Part IIOperations Research, 1963