Colourful Linear Programming and its Relatives
نویسندگان
چکیده
منابع مشابه
Colourful Linear Programming and its Relatives
We consider the following Colourful generalization of Linear Programming: given sets of points S, ... , Sk C Rd, referred to as colours, and a point b E Rd, decide whether there is a colourful T = {s ..., Sk such that b E conv(T), and if there is one, find it. Linear Programming is obtained by taking k = d + 1 and S = = Sd,+. + If k = d + 1 and b E nf I+ conv(S) then a solution always exists: w...
متن کاملnearly optimal linear programming and its application in farm management
linear programming has been employed in many areas of constrained optimization including in agricultural planning for a long time. one of the most important disadvantages of such a method is that there is only one optimum solution for a given objective function and constraints set. another method named nearly optimal linear programming has been developed for solving the problem. this method can...
متن کاملSolving fully fuzzy linear programming
In this paper, a new method is proposed to find the fuzzy optimal solution of fully fuzzy linear programming (abbreviated to FFLP) problems. Also, we employ linear programming (LP) with equality constraints to find a nonegative fuzzy number vector x which satisfies Ax =b, where A is a fuzzy number matrix. Then we investigate the existence of a positive solution of fully fuzzy linear system (FFLS).
متن کاملLife and Its Close Relatives
When driven by an external thermodynamic gradient, nonbiological physical systems can exhibit a wide range of behaviours usually associated with living systems. Consequently, Artificial Life researchers should be open to the possibility that there is no hard-and-fast distinction between the biological and the physical. This suggests a novel field of research: the application of biologists’ meth...
متن کاملLinear Programming and Integer Linear Programming
5 Algorithms 8 5.1 Fourier-Motzkin Elimination . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 5.2 The Simplex Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 5.3 Seidel’s Randomized Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . 9 5.4 The Ellipsoid Method . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 5.5 Using the Ellipsoid...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Operations Research
سال: 1997
ISSN: 0364-765X,1526-5471
DOI: 10.1287/moor.22.3.550