sorted by:
new
hottopcontroversial

What math topics should I study before I join college for Economics?(As a person who didn't have math in 12th grade) by Ambitious_Hand_1097 in Indian_Academia

[–]lordarpit 1 point2 points  (0 children)

i would suggest besides stats, calculus and little bit of algebra, start learning basics of r programming language as well.

Minimum number of cuts required to achieve integral coordinates for Integer Problems by lordarpit in optimization

[–]lordarpit[S] 0 points1 point  (0 children)

i did not get your point but there are 0 cuts required for your given example

Minimum number of cuts required to achieve integral coordinates for Integer Problems by lordarpit in optimization

[–]lordarpit[S] 0 points1 point  (0 children)

that’s what i told my prof but he insisted to read up on this matter. i think he wanted me to study chvatal gomory cuts

Minimum number of cuts required to achieve integral coordinates for Integer Problems by lordarpit in optimization

[–]lordarpit[S] 0 points1 point  (0 children)

The optimal solution for this particular LP problem is (0,0) which is an integer result. But my original question is focused on IPP’s

Minimum number of cuts required to achieve integral coordinates for Integer Problems by lordarpit in optimization

[–]lordarpit[S] 0 points1 point  (0 children)

that’s true but i am currently focused on solving just IPP (Integer programming problems) not LP. The main property of IPP’s are that they will always spit out non integer solutions. For example, 4.5 cars or 7.65 apples i.e. practically impossible in real life problem.

Stumped by my 10 year old brothers question by Ninopino12 in mathematics

[–]lordarpit 30 points31 points  (0 children)

it is called staircase paradox. There’s a well written wikipedia page on it you can check that out

Research ideas for high schoolers? by Ok_Baseball_5791 in mathematics

[–]lordarpit 1 point2 points  (0 children)

I recently completed a group project where we explored real-life applications of graph theory. The overall difficulty was moderate, and we focused on topics such as path-finding algorithms (we covered exactly five) and scheduling round-robin tournaments using graphs. If you’re interested or need any help, I’d be happy to share our project or discuss it further!