Formulate this as a linear programming problem

  • Thread starter Thread starter chwala
  • Start date Start date
chwala
Gold Member
Messages
2,825
Reaction score
413
Homework Statement
See attached: this decision maths text book I realized has a number of wrong notations and solutions in various topics:critical path etc

Just counter check the phrase "twice as many pockets as desktop"

Is that correct? Is it not firstly, ##2y=x##
Relevant Equations
Decision maths
See attached ...
 

Attachments

  • 20250609_105535.webp
    20250609_105535.webp
    41.6 KB · Views: 11
Physics news on Phys.org
I believe ##x## is used for desktop diaries and ##y## is used for pocket diaries.

They key word is “at least”

“They will need at least twice as many pocket diaries as desktop diaries”……translation: “the number of pocket diaries must be greater than or equal to 2 times the number of desktop diaries”

So

##y \geq 2x##
 
And this one, sorry, am using phone to type...
Number 2,
For kruskal algorithm, CE shouldn't be connected as it forms a cycle, correct? ...or a cycle refers to connected vertices? am I missing something. See my sketch...
 

Attachments

  • 20250609_145707.webp
    20250609_145707.webp
    35.4 KB · Views: 17
  • 20250609_145719.webp
    20250609_145719.webp
    18.1 KB · Views: 6
  • 20250609_150814.webp
    20250609_150814.webp
    31.6 KB · Views: 7
Last edited:
chwala said:
Just counter check the phrase "twice as many pockets as desktop"

Is that correct? Is it not firstly, ##2y=x##
The phrase “there is twice as many ## y ## as ## x ##” means ## y=2x ##.
 
chwala said:
...or a cycle refers to connected vertices?
Yes, it does.

The edge CE is included into the minimum spanning tree too.
 
Gavran said:
Yes, it does.

The edge CE is included into the minimum spanning tree too.
I thought CE shouldn't be connected as shown on text, as that does not conform to the kruskal algorithm. I stand to be corrected.

Just seen that intersection can occur as long as the vertices are not connected to form loop, in that case the textbook is correct. Cheers man.
 
Last edited:
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...

Similar threads

Back
Top