You are here

Home » Content

LİNEER PROGRAMLAMA PROBLEMLERİNDE KARŞILAŞILAN ÖZEL DURUMLARIN MATEMATİK ANALİZİ

MATHEMATICAL ANALYSES OF SOME SPECIAL CASES FACED IN LINEAR PROGRAMMING PROBLEMS

Journal Name:

  • Trakya Üniversitesi Fen Bilimleri Dergisi

Publication Year:

  • 2002

Key Words:

Keywords (Original Language):

Author NameUniversity of AuthorFaculty of Author
Abstract (2. Language): 
This article introduces some important cases often encountered in the simplex method applications The means of explanations are numerical examples ilustrating different cases. The cases discussed inlude: 1. Degeneracy, 2. Unbounded solutions, 3. Alternative optimal solutions.
Bookmark/Search this post with
Abstract (Original Language): 
Burada L.P. (Lineer Programlama) analitik-nümerik açıdan ele alınmış simpleks algoritmasında karşılaşılan özel durumlar matris-vektör işlemleri ile analiz edilmiştir.Bunlar: 1. Dejenerasyon , 2. Sınırsız çözümler, 3. Alternatif optimum çözümler olacaktır.
FULL TEXT (PDF): 
PDF icon arastirmax-lineer-programlama-problemlerinde-karsilasilan-ozel-durumlarin-matematik-analizi.pdf
  • 1
17-28
  • Turkish

REFERENCES

References: 

1-Beale E.M.L “Cycling in the Dual Simplex Algorithm” Naval Logistic Quarterly, 2 (4) pp. 269-276, December 1995.
2-Bazarra M. –Jarvis J.J.– Sherali H.D. Linear programming And Network Flows John Wiley & Sons 1990.
3-Gass S. I. Linear Programming Methods & Applications 4’th Ed. 1975 McGraw Hill-Kogakusha Tokyo.
4-Taha H. A. Operations Researh An Introduction 6’th Ed. Prentice-Hall Inc. 1997 N.J.
5-Tulunay Y. Matematik Programlama ve İşletme Uygulamaları İst. Ün. İşl. Fak Yay. No:108 İstanbul 1980.
6-Walsh G.R. An Introduction to Linear Programming Holt, Rinehart and Winston 1971.

Thank you for copying data from http://www.arastirmax.com