Article: Using feasible direction to find all alternative extreme optimal points for linear programming problem.

Abstract: We presented a feasible direction method to find all optimal extreme points for the linear programming problem. Our method depends on the conjugate gradient projection method starting with an initial point we generate a sequence of feasible directions towards all alternative extremes.

Key words: Linear program, conjugate projection

INTRODUCTION

The problem of linear programming (LP) is one of the earliest formulated problems in mathematical programming where a linear function has to be maximized (minimized) over convex constraint polyhedron X. The simplex algorithm was early suggested for solving this problem by moving toward a ...

Related newspaper, magazine, and journal articles:

 
 
Newsweek Harper's Magazine The Washington Post Chicago Tribune Crain's Chicago Business PRNewswire Pediatric News The Nation Advertising Age The Economist (US) A FREE trial gives you access to over 80 million articles! Access over 6,500 publications with a FREE trial!