Inverse feasible problem
نویسنده
چکیده مقاله:
In many infeasible linear programs it is important to construct it to a feasible problem with a minimum pa-rameters changing corresponding to a given nonnegative vector. This paper defines a new inverse problem, called “inverse feasible problem”. For a given infeasible polyhedron and an n-vector a minimum perturba-tion on the parameters can be applied and then a feasible polyhedron is concluded.
منابع مشابه
inverse feasible problem
in many infeasible linear programs it is important to construct it to a feasible problem with a minimum pa-rameters changing corresponding to a given nonnegative vector. this paper defines a new inverse problem, called “inverse feasible problem”. for a given infeasible polyhedron and an n-vector a minimum perturba-tion on the parameters can be applied and then a feasible polyhedron is concluded.
متن کاملTransfomation of Non-feasible Inverse Maximum Flow Problem into a Feasible one by Flow Modification
A linear time method to decide if any inverse maximum flow (denoted IMFG) problem has solution is presented. For the case of IMFG not being feasible, a new inverse combinatorial optimization problem is introduced and solved. The problem is to modify as little as possible the flow so that the problem becomes feasible for the modified flow. Key–Words: inverse combinatorial optimization, maximum f...
متن کامل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 صفحه اولThe Feasible Matching Problem
Let G = (V,E) be a graph and R ⊆ E. A matching M in G is called R-feasible if the subgraph induced by the M -saturated vertices does not have an edge of R. We show that the general problem of finding a maximum size Rfeasible matching in G is NP-hard and identify several natural applications of this new concept. In particular, we use R-feasible matchings to give a necessary and sufficient condit...
متن کاملAN INVERSE PROBLEM WITH UNKNOWN RADIATION TERM
In this paper, we consider an inverse problem of linear heat equation with nonlinear boundary condition. We identify the temperature and the unknown radiation tern from an overspecified condition on the boundary
متن کاملThe Minimum Feasible Tileset Problem
We consider the Minimum Feasible Tileset problem: Given a set of symbols and subsets of these symbols (scenarios), find a smallest possible number of pairs of symbols (tiles) such that each scenario can be formed by selecting at most one symbol from each tile. We show that this problem is NP-complete even if each scenario contains at most three symbols. Our main result is a 4/3-approximation al...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ذخیره در منابع من قبلا به منابع من ذحیره شده{@ msg_add @}
عنوان ژورنال
دوره 1 شماره 1
صفحات 48- 49
تاریخ انتشار 2005-09-01
با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.
کلمات کلیدی
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023