Duality theory for the matrix linear programming problem
نویسندگان
چکیده
منابع مشابه
Theory for the Matrix Linear Programming Problem
Multiple objective linear programming, also known as the linear vector maximization problem, has been studied by a number of authors. In particular, its duality theory has been considered by Philip [9], Isermann [7], Gray and Sutherland [5], Brumelle [1], and Ponstein [10]. Neither the symmetry nor all the relationships of the duality theory of conventional linear programming, however, have bee...
متن کاملSome Duality Results in Grey Linear Programming Problem
Different approaches are presented to address the uncertainty of data and appropriate description of uncertain parameters of linear programming models. One of them is to use the grey systems theory in modeling such problem. Especially, recently, grey linear programming has attracted many researchers. In this paper, a kind of linear programming with grey coefficients is discussed. Introducing th...
متن کاملDuality Theory for Interval Linear Programming Problems
We define the primal and dual linear programming problems involving interval numbers as the way of traditional linear programming problems. We discuss the solution concepts of primal and dual linear programming problems involving interval numbers without converting them to classical linear programming problems. By introducing new arithmetic operations between interval numbers, we prove the weak...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اول3.1 Linear Programming Duality
In the previous few lectures we have seen examples of LP-rounding, a method for obtaining approximation algorithms that involves solving a linear programming relaxation of the problem at hand and rounding the solution. In the last lecture we also discussed the basic theory of LP-duality. Today we will apply this theory to obtain a second LP-based technique for obtaining approximation algorithms...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1984
ISSN: 0022-247X
DOI: 10.1016/0022-247x(84)90028-3