A Farkas-type theorem for interval linear inequalities

نویسنده

  • Jiri Rohn
چکیده

We describe a Farkas-type condition for strong solvability of interval linear inequalities. The result is used to derive several descriptions of the set of strong solutions and to show that this set forms a convex polytope.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Random differential inequalities and comparison principles for nonlinear hybrid random differential equations

 In this paper, some basic results concerning strict, nonstrict inequalities, local existence theorem and differential inequalities  have been proved for an IVP of first order hybrid  random differential equations with the linear perturbation of second type. A comparison theorem is proved and  applied to prove the uniqueness of random solution for the considered perturbed random differential eq...

متن کامل

Examples of Combinatorial Duality

We will consider two easily stated combinatorial problems, determining if a given sequence of integers could arise as the numbers of wins in a round robin tournament and determining if a diagram of relations can be realized as ‘comes before’ for a set of intervals in time. Both problems will be given equivalent formulations of determining if a system of inequalities has a solution. These partic...

متن کامل

An Elimination Theorem for Mixed Real-integer Systems

An elimination result for mixed real-integer systems of linear equations is established, and used to give a short proof for an adaptation of Farkas’ Lemma by Köppe and Weismantel [4]. An extension of the elimination theorem to a quantifier elimination result is indicated. Let A be an m × n-matrix with real entries and b ∈ R. (In the following, we think of elements of the various euclidean space...

متن کامل

The dependency diagram of a linear programme

The Dependency Diagram of a Linear Programme (LP) shows how the successive inequalities of an LP depend on former inequalities, when variables are projected out by Fourier-Motzkin Elimination. It is also explained how redundant inequalities can be removed, using the method attributed to Chernikov and to Kohler. The procedure also leads to a transparent explanation of Farkas’Lemma, LP Duality, t...

متن کامل

Fuzzy Linear Programming and its Application for a Constructive Proof of a Fuzzy Version of Farkas Lemma

The main aim of this paper is to deal with a fuzzy version of Farkas lemma involving trapezoidal fuzzy numbers. In turns to that the fuzzy linear programming and duality theory on these problems can be used to provide a constructive proof for Farkas lemma. Keywords Farkas Lemma, Fuzzy Linear Programming, Duality, Ranking Functions.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Optimization Letters

دوره 8  شماره 

صفحات  -

تاریخ انتشار 2014