الفهرس 
CHAPTER 1 ALGORITHMS FOR THE VECTOR MAXIMIZATION PROBL" ~ "M AND SOLVING THE MULTIPLE OBJECTIVE PROBLEM USitl!G PARETO METHODOnly 14 pages are availabe for public view
 |  | from | 223 |  |  |
| | | from | 223 | | |
Abstract
THE MAIN OBJECT OF THIS THESIS IS TO FIND THE SET OF OPTIMUM SOLUTIONS (NON-DOMINATED EXTREME POINTS), AND THE SET OF OPTIMUM PARAMETERS FOR THE LINEAR MULTIPARAMETRIC PROGRAMMING PROBLEMS, IN WHICH THE PARAMETERS ARE IN THE OBJECTIVE FUNCTIONS OR IN THE RIGH HAND SIDE OF CONSTRAINTS .
ALSO WE STUDY THE THEORETICAL BASIS AND SOME ALGORITHMS FOR THE VECTOR MAXIMIZATION PROBLEM FOR THE GENERAL VIEWPOINT OF J. PHILIP IN 1972(4). FURTHERMORE WE INTRODUCED THE CONCEPTS OF PARETO OPTIMALITY WHICH FOUND IT’S WAY INTO OPERATIONS RESEARCH IN THE PIONEERING WORK OF J.G. LINE (5)1976, where HE FOUND THE PARETO-OPTIMAL SOLUTIONS FOR THE MULTIPLE-OBJECTIVE PROBLEMS.
MOREOVER, WE DEMONSTRATE IN DETAILS THE PREVIOUS IN CHAPTER 1. IN CHAPTER 2 WE SHOW HOW TO SOLVE THE LINEAR MULTIPARAMETRIC PROGRAMMING PROGRAMMING PROBIEMS BY THE SIMPLEX TECHNIQUES.