On Extreme Point Programming Problem

DOI10.1080/02522667.1982.10698727MaRDI QIDQ3320149zbMATH OpenOpenAlexFDO

Authors Sushma Bansal

Publication date 1982

Published in Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02522667.1982.10698727

zbMATH Keywords

enumerationsolution algorithmdual problemcutting plane techniqueextreme point linear fractional programmingranking of basic non- feasible solutions

Mathematics Subject Classification ID

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

Recommendations

• Extreme point quadratic fractional programming problem
• An extreme-point-ranking algorithm for the extreme-point mathematical programming problem
• Programming with fractional linear objective functions
• A Parametric Method for Solving the Linear Fractional Programming Problem
• An algorithm for two-criterion linear fractional programming.

Cites work

• Letter to the Editor—Linear Fractional Functionals Programming

Cited in

(7)

• Extreme point quadratic fractional programming problem
• An extreme-point-ranking algorithm for the extreme-point mathematical programming problem
• A versatile scheme for ranking the extreme points of an assignment polytope
• On the complexity of the extreme points decision problem
• scientific article; zbMATH DE number 3939126 (Why is no real title available?)
• A branch and bound algorithm for extreme point mathematical programming problems
• A finite procedure to generate feasible points for the extreme point mathematical programming problem

This page was built for publication: On Extreme Point Programming Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3320149)