Sign inSubmit

Journal of Mathematics and Statistics

ISSN 1549-3644 (print)eISSN 1558-6359 (online) Open access
Sign up for alertsSubmit manuscript
ArticleArticle metrics
Research Article · Free to read · Published 30 September 2007

Using Feasible Direction to Find All Alternative Extreme Optimal Points for Linear Programming Problem

S. F. Tantawy

Journal of Mathematics and Statistics, Volume 3, Issue 3, pp. 109–111 · doi.org/10.3844/jmssp.2007.109.111

7,062 accesses5,458 downloads3 citations (Crossref)Journal metrics
Cite Check for updates

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.

Licence and reuse

Free to read. This article carries the publisher’s copyright, as printed on it: © 2007 Science Publications. It is free to read; ask us before reusing it.

How to reuse this article

Responses (0)

Have a comment on this research? Sign in to respond. Responses are moderated and published with your name and affiliation; the authors are invited to reply. How we use your dataWrite a response

About this article

Cite this article

Tantawy, S. F. (2007). Using Feasible Direction to Find All Alternative Extreme Optimal Points for Linear Programming Problem. Journal of Mathematics and Statistics, 3(3), 109–111. https://doi.org/10.3844/jmssp.2007.109.111

Licence
© Science Publications
Issue
Volume 3, Issue 3
Policies
Editorial independenceUse of generative AIData availabilityAppeals and complaints
Version
Version of record
Using Feasible Direction to Find All Alternative Extreme Optimal Points for Linear Programming ProblemJournal of Mathematics and Statistics · Volume 3, Issue 3 · pp. 109–111 · © Science PublicationsDownload