Recent content by mertcan
-
A linear programming, polyhedron and extreme points
very thanks for your reply. Well, may I ask if ANY TWO extreme points in a polyhedron can be linearly dependent or not (those 2 extreme points are multiple of each other or not), could you provide me with a proof? Thanks- mertcan
- Post #3
- Forum: Linear and Abstract Algebra
-
A linear programming, polyhedron and extreme points
Hi, First assume that there is a polyhedron P, where Ax<=b and x is free variable whose dimension is n. Besides, rank(A) = n. I really wonder if extreme points in a polyhedron can be linearly dependent? I used even ChatGPT, but it includes some shaky calculations while proofing. In short, if...- mertcan
- Thread
- Replies: 3
- Forum: Linear and Abstract Algebra
-
C/C++ Parallel processing for loops and pointer defined outside the loop
Thank you @DrClaude for your valuable return. May I ask a small question related to for loop during parallelization: Lets say we have a nested for loops consisting of 2 for loops (as you know OpenMP does not allow break or goto statements if the loop is parallelized) so if we just parallelize...- mertcan
- Post #10
- Forum: Programming and Computer Science
-
C/C++ Parallel processing for loops and pointer defined outside the loop
Thank you DrClaude for your explanatory and kind return. Please correct me if I understand wrong: lets say we have created a pointer using "new" outside the parallel for loop, and you say during the privatization (without firstprivate) of that pointer, each thread will create that pointer...- mertcan
- Post #8
- Forum: Programming and Computer Science
-
C/C++ Parallel processing for loops and pointer defined outside the loop
Thank you for your nice answer.- mertcan
- Post #7
- Forum: Programming and Computer Science
-
C/C++ Parallel processing for loops and pointer defined outside the loop
Thank you for your kind return, I asked because I try to comprehend the structure behind OMP for my project. Whenever I see, during the privatization for "for loop", an integer or double variable examples take place. I have not see an integer pointer example for privatization. So, is it possible...- mertcan
- Post #4
- Forum: Programming and Computer Science
-
C/C++ Parallel processing for loops and pointer defined outside the loop
Hi everyone; hope you are well. I have a small question: As far as I have searched, for example we can make integer variable defined outside the for loop private for multiple threads, but is it also possible to apply this situation for an integer pointer defined outside the for loop? I mean if a...- mertcan
- Thread
- Pointers Variables
- Replies: 14
- Forum: Programming and Computer Science
-
Linear programming and resolution theorem
Could we also proceed with L=1 case to grasp the entire logic if you do not mind?- mertcan
- Post #18
- Forum: Calculus and Beyond Homework Help
-
Linear programming and resolution theorem
yes I got what we just done but I am still in a impasse when other equations added...- mertcan
- Post #17
- Forum: Calculus and Beyond Homework Help
-
Linear programming and resolution theorem
I would assign 1 to the biggest cost function- mertcan
- Post #15
- Forum: Calculus and Beyond Homework Help
-
Linear programming and resolution theorem
last equation you just written implies we have convex combination of cost function at extreme points of the region which is the intersection of P and additional equality constraints...- mertcan
- Post #13
- Forum: Calculus and Beyond Homework Help
-
Linear programming and resolution theorem
we have no extreme rays- mertcan
- Post #11
- Forum: Calculus and Beyond Homework Help
-
Linear programming and resolution theorem
I understand when we think of the question in small dimensions then I am ok, but how can we generalise it?- mertcan
- Post #9
- Forum: Calculus and Beyond Homework Help
-
Linear programming and resolution theorem
I got what you mean for instance if L=0 then optimal point would be the convex combination of just 1 point of P then optimal point actually would be the extreme point of P, if L=1 then optimal point may be the convex combination of 2 adjacent extreme point of P, but how can I proceed then using...- mertcan
- Post #7
- Forum: Calculus and Beyond Homework Help
-
Linear programming and resolution theorem
Actually I must confess that I have been struggling for 10 days for that question but nothing comes to my mind I really do not know how to start how to proceed...- mertcan
- Post #5
- Forum: Calculus and Beyond Homework Help