Formulate this as a linear programming problem

  • Thread starter Thread starter chwala
  • Start date Start date
Click For Summary
The discussion centers on formulating a linear programming problem involving desktop and pocket diaries, where the number of pocket diaries must be at least twice the number of desktop diaries, expressed as y ≥ 2x. Participants clarify the correct interpretation of the phrase "twice as many pocket diaries as desktop diaries," confirming that it translates to y = 2x. Additionally, there is a debate regarding the application of Kruskal's algorithm, specifically whether edge CE should be included in the minimum spanning tree, with some confusion about cycles and connected vertices. Ultimately, it is agreed that intersections can occur as long as they do not form a loop, validating the textbook's approach. The conversation emphasizes the importance of precise language in mathematical formulations and algorithm applications.
chwala
Gold Member
Messages
2,827
Reaction score
415
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: 15
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: 37
  • 20250609_145719.webp
    20250609_145719.webp
    18.1 KB · Views: 8
  • 20250609_150814.webp
    20250609_150814.webp
    31.6 KB · Views: 12
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:
First, I tried to show that ##f_n## converges uniformly on ##[0,2\pi]##, which is true since ##f_n \rightarrow 0## for ##n \rightarrow \infty## and ##\sigma_n=\mathrm{sup}\left| \frac{\sin\left(\frac{n^2}{n+\frac 15}x\right)}{n^{x^2-3x+3}} \right| \leq \frac{1}{|n^{x^2-3x+3}|} \leq \frac{1}{n^{\frac 34}}\rightarrow 0##. I can't use neither Leibnitz's test nor Abel's test. For Dirichlet's test I would need to show, that ##\sin\left(\frac{n^2}{n+\frac 15}x \right)## has partialy bounded sums...

Similar threads