video

sound

Persian Version

View:

792

Download:

Cites:

Information Seminar Paper

Title

LINEAR PROGRAMMING PROBLEM WITH INTERVAL DATA

Pages

 Start Page | End Page

Abstract

 SUPPOSE THAT THE COEFFICIENT OF OBJECTIVE FUNCTION, THE COEFFICIENT MATRIX AND THE RIGHT-HAND SIDE CONSTRAINTS ARE NOT DETERMINED EXACTLY, BUT ARE ONLY KNOWN TO LIE WITHIN SOME REAL INTERVALS. SUCH A DECISION PROBLEM WHICH REPRESENTS A FAMILY OF LINEAR PROGRAMMING PROBLEMS IS CALLED AN INTERVAL LINEAR PROGRAMMING PROBLEM. IN THIS PAPER WE PROPOSE A NEW CONCEPT OF SOLVING THE LINEAR PROGRAMMING PROBLEMS WITH INTERVAL COEFFICIENTS. OUR PROPOSAL IS BASED ON THE NOTION OF THE RANGE OF THE UNIQUELY DETERMINED OPTIMAL VALUE OF EACH LINEAR PROGRAMMING PROBLEM IN THE FAMILY OVER THE INTERVAL DATA. WE DRIVE FORMULAE FOR COMPUTING THIS RANGE AS THE CORNERSTONE OF OUR APPROACH WHICH WILL ALLOW THE DECISION MAKER TO HAVE A GENERAL VIEW OF THE PROBLEM AND TO CHOOSE THE FINAL SOLUTION IN A WAY THAT BEST SUITS HIS PREFERENCES.

Cites

  • No record.
  • References

  • No record.
  • Related Journal Papers

  • No record.
  • Related Seminar Papers

  • No record.
  • Related Plans

  • No record.
  • Recommended Workshops