Ranking of vertices in the linear fractional programming problem

DOI10.1007/BF01934470zbMath0517.90079OpenAlexW2001541577MaRDI QIDQ1053617

Sverre Storøy

Publication date: 1983

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01934470

zbMATH Keywords

linear fractional programming23, 403-405 (1983)vertex ranking algorithms

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Fractional programming (90C32) Linear programming (90C05)

Related Items (3)

Enumerative techniques for solving some nonconvex global optimization problems ⋮ An algorithm for a class of nonlinear fractional problems using ranking of the vertices ⋮ Pivoting rules and redundancy schemes in extreme point enumeration

Cites Work

• Unnamed Item
• Unnamed Item
• Bicriteria linear fractional programming
• A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
• Decomposed enumeration of extreme points in the linear programming problem
• A Linear Programming Approach to the Cutting Stock Problem—Part II
• Seven Kinds of Convexity
• Solving the Fixed Charge Problem by Ranking the Extreme Points

This page was built for publication: Ranking of vertices in the linear fractional programming problem