Suppose that
x
,
y
,
z
,
ν<!-- ν -->
,
N
,
g
are some postitiv
Isaiah Owens
Answered question
2022-05-21
Suppose that , , , , , are some postitive parameters and , and are variables that belong to . I want to identify one or all of the feasible points taht solve the following system of inequalities with respect to , and
Answer & Explanation
Erzrivalef6
Beginner2022-05-22Added 10 answers
We can rewrite the system of inequalities, including the restrictions on A,B,C to be positive, as follows:
The feasible region is convex, an intersection of six open half-spaces, each delineated by a plane passing through the origin. It is possible for this intersection to be empty, unlike the relaxed "weak inequalites" system where the origin (0,0,0) will always be a solution. Note that if (A,B,C) is a feasible point, then so too is any positive scalar multiple r>0 of it, (rA,rB,rC). So geometrically, if the feasible region is not empty, it consists of a collection of open rays proceeding from the origin. If the coefficients were known, we could represent the feasible region by taking its intersection with the plane:
That intersection (if not empty) is an open polygon (the polygon excluding its perimeter). Such a polygon would be convex and have at most six sides, and its vertices can be readily computed by many linear programming packages. The feasible region of your problem is then all the open rays proceeding from the origin through a point in that open polygon. The points in the open polygon can be parameterized by barycentric coordinates.