On Extreme Point Programming Problem

DOI10.1080/02522667.1982.10698727zbMATH Open0535.90091OpenAlexW1998945561MaRDI QIDQ3320149FDOQ3320149

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

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.

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)

Cites Work

• Letter to the Editor—Linear Fractional Functionals Programming

Cited In (7)

• A finite procedure to generate feasible points for the extreme point mathematical programming problem
• An extreme-point-ranking algorithm for the extreme-point mathematical programming problem
• A branch and bound algorithm for extreme point mathematical programming problems
• Title not available (Why is that?)
• A versatile scheme for ranking the extreme points of an assignment polytope
• On the complexity of the extreme points decision problem
• Extreme point quadratic fractional 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)