Recent content by StIgM@

I have the following 0-1 knapsack problem variant: I want to buy X units of a product at min cost, and there are m farmers that offer: - farmer 1: a11 units at cost c11, ..., a1n1 units at cost c1n1 ... - farmer m: am1 units at cost cm1, ..., amnm units at cost cmnm and I can choose at most...

For example it is given the relation R:X<--->X So, we want to check if it is partially ordered. The only checks that we have to write are: \forAll x:X | x-->x \in R \forAll x,y:X | x--->y \in R \and x\notEqual y \isthecasethat y--->y \notIn R \forAll x,y,z:X | x--->y \in R \and...

Hello, I am trying to find out how you can prove that a relation is partially ordered. I know that it must be reflexive, antisymmetric and transitive but if a relation is given how do you write that it should be partially ordered? For example I have the relation R: X\leftrightarrowX I want to...

Hello Guys, I am confused about something. How do you differentiate the partial and total function? I know that partial functions do not use the whole domain, but how do you know if the whole domain will be used? For example, I want to define an operation for the AUDI car company and I...

Hello Guys, I am confused about something. How do you differentiate the partial and total function? I know that partial functions do not use the whole domain, but how do you know if the whole domain will be used? For example, I want to define an operation for the AUDI car company and I...

Ok, I get your meaning but you didn't give an answer to my example! Do you know if this is correct? For example? I have the relations X: A <---> B Y: B <---> C Z: A <---> C X relational composition Y can be a subset of Z (if Z contains all the pairs of the composition) ?

Hello guys, I am new to this forum. I have a question: A relation can be subset of some other relation? For example? I have the relations X: A <---> B Y: B <---> C Z: A <---> C X...