Ranking of vertices in the linear fractional programming problem
type: Item
instance of: scholarly article
title: Ranking of vertices in the linear fractional programming problem
zbMATH Open document ID: 0517.90079
DOI: 10.1007/BF01934470
published in: BIT
publication date: 1983-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C32
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 3819487
zbMATH Keywords: 23, 403-405 (1983)
zbMATH Keywords: linear fractional programming
zbMATH Keywords: vertex ranking algorithms
author: Sverre Storøy
MaRDI profile type: Publication
cites work: Q5627914
cites work: Bicriteria linear fractional programming
cites work: Decomposed enumeration of extreme points in the linear programming problem
cites work: A Linear Programming Approach to the Cutting Stock Problem—Part II
cites work: Q5630824
cites work: A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
cites work: Solving the Fixed Charge Problem by Ranking the Extreme Points
cites work: Seven Kinds of Convexity
full work available at URL: https://doi.org/10.1007/bf01934470
OpenAlex ID: W2001541577
description: scientific article; zbMATH DE number 3819487