Optimisation Problem for Pipe Nesting












1














I work in a company where we are supposed to produce and send pipes using trucks to buyers. Pipes of smaller diameter can be nested inside pipes of larger diameter while sending to minimize number of trucks.



The trucks that carry these pipes are usually 40 feet / 12.192 meters long while the pipes are 12 metres long. Hence, they are placed length wise along the trailer.



The trucks are usually 8 feet / 2.438 metres high and wide ie 8x8.



The outer diameters of pipe that we make are 90, 110, 125, 140, 160, 180, 200, 250 and 315 (all sizes in mm).



A constraint here is that while nesting, pipe of one size can only be nested inside pipe one size greater than the next size. Example, 90 pipe can go into 125 and higher pipe size, 140 pipe can go into 160 or higher pipe size.



I wish to mathematically derive a system for optimum loading of the trucks to minimize the number of trucks to deliver the ordered quantity of various sizes using nesting because we often goof-up with nesting resulting in huge cost implications. Can some one please help?



(Also, I am a naive user. It would also be helpful if you can suggest the appropriate tags that I should put along the question to help people notice the question.)






optimization applications







share|cite|improve this question
























  • You haven't really specified a constraint for how many pipes of some size you want to transport. In that case the answer you be 1, which is clearly incorrect. You need to enumerate (or at least give a constraint) on how many of certain pipe sizes you want to move before dealing with optimality.
    – Malcolm
    Jun 17 '15 at 23:17










  • Hey Malcolm, the costraint here is the width and the height of the truck which limits the number of pipes that i can place side by side and on top of each other.I get orders with different quantities of different sizes. Say, 15pipes of 110mm, 48 pipes of 160mm, 80 pipes of 200 mm dia and so on. The orders require more than one truck. My agenda is to minimize the number of trucks
    – Shobhan Taparia
    Jun 17 '15 at 23:21










  • Well first you should take a look at this article which is about circle packing in a square. They've calculated the optimal packing strategy up to 20 circles. Secondly, a general off the cuff optimization model that comes on the top of my head is putting all the pipes of the biggest and same size on one truck and packing as many pipes in them as you can linkhere, and repeating this for the next truck with whatever pipes you have left over. This is based on intuition though, not anything remotely numerical since you have provided none.
    – Malcolm
    Jun 17 '15 at 23:49












  • Should one transport equal number of all sizes of pipes, or would the company be happy if we (for example) only transport the smallest pipes?
    – Tommi Brander
    Jun 18 '15 at 6:08










  • Hey Malcolm, I wish to have a generic solution and not a specific solution of one single problem. You can assume the following data for a sample case: 90mm-138061 meter, 110mm-48000 meter, 125mm-1306 meter, 140mm-16509 meter , 160mm-10615 meter, 200mm-166 meter.
    – Shobhan Taparia
    Jun 18 '15 at 8:27
















1














I work in a company where we are supposed to produce and send pipes using trucks to buyers. Pipes of smaller diameter can be nested inside pipes of larger diameter while sending to minimize number of trucks.



The trucks that carry these pipes are usually 40 feet / 12.192 meters long while the pipes are 12 metres long. Hence, they are placed length wise along the trailer.



The trucks are usually 8 feet / 2.438 metres high and wide ie 8x8.



The outer diameters of pipe that we make are 90, 110, 125, 140, 160, 180, 200, 250 and 315 (all sizes in mm).



A constraint here is that while nesting, pipe of one size can only be nested inside pipe one size greater than the next size. Example, 90 pipe can go into 125 and higher pipe size, 140 pipe can go into 160 or higher pipe size.



I wish to mathematically derive a system for optimum loading of the trucks to minimize the number of trucks to deliver the ordered quantity of various sizes using nesting because we often goof-up with nesting resulting in huge cost implications. Can some one please help?



(Also, I am a naive user. It would also be helpful if you can suggest the appropriate tags that I should put along the question to help people notice the question.)






optimization applications







share|cite|improve this question
























  • You haven't really specified a constraint for how many pipes of some size you want to transport. In that case the answer you be 1, which is clearly incorrect. You need to enumerate (or at least give a constraint) on how many of certain pipe sizes you want to move before dealing with optimality.
    – Malcolm
    Jun 17 '15 at 23:17










  • Hey Malcolm, the costraint here is the width and the height of the truck which limits the number of pipes that i can place side by side and on top of each other.I get orders with different quantities of different sizes. Say, 15pipes of 110mm, 48 pipes of 160mm, 80 pipes of 200 mm dia and so on. The orders require more than one truck. My agenda is to minimize the number of trucks
    – Shobhan Taparia
    Jun 17 '15 at 23:21










  • Well first you should take a look at this article which is about circle packing in a square. They've calculated the optimal packing strategy up to 20 circles. Secondly, a general off the cuff optimization model that comes on the top of my head is putting all the pipes of the biggest and same size on one truck and packing as many pipes in them as you can linkhere, and repeating this for the next truck with whatever pipes you have left over. This is based on intuition though, not anything remotely numerical since you have provided none.
    – Malcolm
    Jun 17 '15 at 23:49












  • Should one transport equal number of all sizes of pipes, or would the company be happy if we (for example) only transport the smallest pipes?
    – Tommi Brander
    Jun 18 '15 at 6:08










  • Hey Malcolm, I wish to have a generic solution and not a specific solution of one single problem. You can assume the following data for a sample case: 90mm-138061 meter, 110mm-48000 meter, 125mm-1306 meter, 140mm-16509 meter , 160mm-10615 meter, 200mm-166 meter.
    – Shobhan Taparia
    Jun 18 '15 at 8:27














1












1








1


1





I work in a company where we are supposed to produce and send pipes using trucks to buyers. Pipes of smaller diameter can be nested inside pipes of larger diameter while sending to minimize number of trucks.



The trucks that carry these pipes are usually 40 feet / 12.192 meters long while the pipes are 12 metres long. Hence, they are placed length wise along the trailer.



The trucks are usually 8 feet / 2.438 metres high and wide ie 8x8.



The outer diameters of pipe that we make are 90, 110, 125, 140, 160, 180, 200, 250 and 315 (all sizes in mm).



A constraint here is that while nesting, pipe of one size can only be nested inside pipe one size greater than the next size. Example, 90 pipe can go into 125 and higher pipe size, 140 pipe can go into 160 or higher pipe size.



I wish to mathematically derive a system for optimum loading of the trucks to minimize the number of trucks to deliver the ordered quantity of various sizes using nesting because we often goof-up with nesting resulting in huge cost implications. Can some one please help?



(Also, I am a naive user. It would also be helpful if you can suggest the appropriate tags that I should put along the question to help people notice the question.)






optimization applications







share|cite|improve this question















I work in a company where we are supposed to produce and send pipes using trucks to buyers. Pipes of smaller diameter can be nested inside pipes of larger diameter while sending to minimize number of trucks.



The trucks that carry these pipes are usually 40 feet / 12.192 meters long while the pipes are 12 metres long. Hence, they are placed length wise along the trailer.



The trucks are usually 8 feet / 2.438 metres high and wide ie 8x8.



The outer diameters of pipe that we make are 90, 110, 125, 140, 160, 180, 200, 250 and 315 (all sizes in mm).



A constraint here is that while nesting, pipe of one size can only be nested inside pipe one size greater than the next size. Example, 90 pipe can go into 125 and higher pipe size, 140 pipe can go into 160 or higher pipe size.



I wish to mathematically derive a system for optimum loading of the trucks to minimize the number of trucks to deliver the ordered quantity of various sizes using nesting because we often goof-up with nesting resulting in huge cost implications. Can some one please help?



(Also, I am a naive user. It would also be helpful if you can suggest the appropriate tags that I should put along the question to help people notice the question.)






optimization applications




optimization applications






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Jun 17 '15 at 23:23









mysatellite

2,14221130




2,14221130










asked Jun 17 '15 at 23:06









Shobhan Taparia

62




62












  • You haven't really specified a constraint for how many pipes of some size you want to transport. In that case the answer you be 1, which is clearly incorrect. You need to enumerate (or at least give a constraint) on how many of certain pipe sizes you want to move before dealing with optimality.
    – Malcolm
    Jun 17 '15 at 23:17










  • Hey Malcolm, the costraint here is the width and the height of the truck which limits the number of pipes that i can place side by side and on top of each other.I get orders with different quantities of different sizes. Say, 15pipes of 110mm, 48 pipes of 160mm, 80 pipes of 200 mm dia and so on. The orders require more than one truck. My agenda is to minimize the number of trucks
    – Shobhan Taparia
    Jun 17 '15 at 23:21










  • Well first you should take a look at this article which is about circle packing in a square. They've calculated the optimal packing strategy up to 20 circles. Secondly, a general off the cuff optimization model that comes on the top of my head is putting all the pipes of the biggest and same size on one truck and packing as many pipes in them as you can linkhere, and repeating this for the next truck with whatever pipes you have left over. This is based on intuition though, not anything remotely numerical since you have provided none.
    – Malcolm
    Jun 17 '15 at 23:49












  • Should one transport equal number of all sizes of pipes, or would the company be happy if we (for example) only transport the smallest pipes?
    – Tommi Brander
    Jun 18 '15 at 6:08










  • Hey Malcolm, I wish to have a generic solution and not a specific solution of one single problem. You can assume the following data for a sample case: 90mm-138061 meter, 110mm-48000 meter, 125mm-1306 meter, 140mm-16509 meter , 160mm-10615 meter, 200mm-166 meter.
    – Shobhan Taparia
    Jun 18 '15 at 8:27


















  • You haven't really specified a constraint for how many pipes of some size you want to transport. In that case the answer you be 1, which is clearly incorrect. You need to enumerate (or at least give a constraint) on how many of certain pipe sizes you want to move before dealing with optimality.
    – Malcolm
    Jun 17 '15 at 23:17










  • Hey Malcolm, the costraint here is the width and the height of the truck which limits the number of pipes that i can place side by side and on top of each other.I get orders with different quantities of different sizes. Say, 15pipes of 110mm, 48 pipes of 160mm, 80 pipes of 200 mm dia and so on. The orders require more than one truck. My agenda is to minimize the number of trucks
    – Shobhan Taparia
    Jun 17 '15 at 23:21










  • Well first you should take a look at this article which is about circle packing in a square. They've calculated the optimal packing strategy up to 20 circles. Secondly, a general off the cuff optimization model that comes on the top of my head is putting all the pipes of the biggest and same size on one truck and packing as many pipes in them as you can linkhere, and repeating this for the next truck with whatever pipes you have left over. This is based on intuition though, not anything remotely numerical since you have provided none.
    – Malcolm
    Jun 17 '15 at 23:49












  • Should one transport equal number of all sizes of pipes, or would the company be happy if we (for example) only transport the smallest pipes?
    – Tommi Brander
    Jun 18 '15 at 6:08










  • Hey Malcolm, I wish to have a generic solution and not a specific solution of one single problem. You can assume the following data for a sample case: 90mm-138061 meter, 110mm-48000 meter, 125mm-1306 meter, 140mm-16509 meter , 160mm-10615 meter, 200mm-166 meter.
    – Shobhan Taparia
    Jun 18 '15 at 8:27
















You haven't really specified a constraint for how many pipes of some size you want to transport. In that case the answer you be 1, which is clearly incorrect. You need to enumerate (or at least give a constraint) on how many of certain pipe sizes you want to move before dealing with optimality.
– Malcolm
Jun 17 '15 at 23:17




You haven't really specified a constraint for how many pipes of some size you want to transport. In that case the answer you be 1, which is clearly incorrect. You need to enumerate (or at least give a constraint) on how many of certain pipe sizes you want to move before dealing with optimality.
– Malcolm
Jun 17 '15 at 23:17












Hey Malcolm, the costraint here is the width and the height of the truck which limits the number of pipes that i can place side by side and on top of each other.I get orders with different quantities of different sizes. Say, 15pipes of 110mm, 48 pipes of 160mm, 80 pipes of 200 mm dia and so on. The orders require more than one truck. My agenda is to minimize the number of trucks
– Shobhan Taparia
Jun 17 '15 at 23:21




Hey Malcolm, the costraint here is the width and the height of the truck which limits the number of pipes that i can place side by side and on top of each other.I get orders with different quantities of different sizes. Say, 15pipes of 110mm, 48 pipes of 160mm, 80 pipes of 200 mm dia and so on. The orders require more than one truck. My agenda is to minimize the number of trucks
– Shobhan Taparia
Jun 17 '15 at 23:21












Well first you should take a look at this article which is about circle packing in a square. They've calculated the optimal packing strategy up to 20 circles. Secondly, a general off the cuff optimization model that comes on the top of my head is putting all the pipes of the biggest and same size on one truck and packing as many pipes in them as you can linkhere, and repeating this for the next truck with whatever pipes you have left over. This is based on intuition though, not anything remotely numerical since you have provided none.
– Malcolm
Jun 17 '15 at 23:49






Well first you should take a look at this article which is about circle packing in a square. They've calculated the optimal packing strategy up to 20 circles. Secondly, a general off the cuff optimization model that comes on the top of my head is putting all the pipes of the biggest and same size on one truck and packing as many pipes in them as you can linkhere, and repeating this for the next truck with whatever pipes you have left over. This is based on intuition though, not anything remotely numerical since you have provided none.
– Malcolm
Jun 17 '15 at 23:49














Should one transport equal number of all sizes of pipes, or would the company be happy if we (for example) only transport the smallest pipes?
– Tommi Brander
Jun 18 '15 at 6:08




Should one transport equal number of all sizes of pipes, or would the company be happy if we (for example) only transport the smallest pipes?
– Tommi Brander
Jun 18 '15 at 6:08












Hey Malcolm, I wish to have a generic solution and not a specific solution of one single problem. You can assume the following data for a sample case: 90mm-138061 meter, 110mm-48000 meter, 125mm-1306 meter, 140mm-16509 meter , 160mm-10615 meter, 200mm-166 meter.
– Shobhan Taparia
Jun 18 '15 at 8:27




Hey Malcolm, I wish to have a generic solution and not a specific solution of one single problem. You can assume the following data for a sample case: 90mm-138061 meter, 110mm-48000 meter, 125mm-1306 meter, 140mm-16509 meter , 160mm-10615 meter, 200mm-166 meter.
– Shobhan Taparia
Jun 18 '15 at 8:27










1 Answer
1






active

oldest

votes


















0














I doubt there is an optimal analytical strategy for solving the problem. You will want to use an optimization approach.



A naive greedy strategy, which is probably decent, but almost certainly not optimal:




  1. Pack in all the largest pipes. For any given truck, this amounts to a problem of packing as many circles as possible into a square; as Malcolm mentioned in a comment, this problem has been explicitly solved in some cases and numerics probably also exist; see https://en.wikipedia.org/wiki/Circle_packing_in_a_square. Use as few trucks as possible.


  2. Consider the largest kind of pipe that has not been packed in yet. First nest them inside the larger pipes. If pipes still remain, try to fit them into the gaps between the larger pipes; pack as carefully as possible. This is a matter of packing circles into an arbitrary bounded area and optimization literature might exist, but explicit solutions almost certainly will not. You can do this one truck at a time. If there are still pipes of the same size remaining, add new trucks; this reduces to step 1., above.


  3. Repeat step 2 for all pipe sizes.



A naive, and not efficient, optimization method would be to remove a pipe (and all nested pipes) of a given size and then try to fit two or more smaller ones into the hole. You should first fill all the trucks with the naive method and then check what size of pipes are in the final one; these are the ones you will want to pack more effectively.



Suppose there are at least two trucks filled with pipes of the critical size. Try removing pipes larger than that from other trucks and replacing them with pipes of the critical size. Take the most empty truck with critical pipes as the one you are trying to empty. Into the other(s) you will try to insert the pipes you have removed from elsewhere.



This would be cumbersome, so probably just stick with the naive algorithm.






share|cite|improve this answer





















    Your Answer





    StackExchange.ifUsing("editor", function () {
    return StackExchange.using("mathjaxEditing", function () {
    StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
    StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
    });
    });
    }, "mathjax-editing");

    StackExchange.ready(function() {
    var channelOptions = {
    tags: "".split(" "),
    id: "69"
    };
    initTagRenderer("".split(" "), "".split(" "), channelOptions);

    StackExchange.using("externalEditor", function() {
    // Have to fire editor after snippets, if snippets enabled
    if (StackExchange.settings.snippets.snippetsEnabled) {
    StackExchange.using("snippets", function() {
    createEditor();
    });
    }
    else {
    createEditor();
    }
    });

    function createEditor() {
    StackExchange.prepareEditor({
    heartbeatType: 'answer',
    autoActivateHeartbeat: false,
    convertImagesToLinks: true,
    noModals: true,
    showLowRepImageUploadWarning: true,
    reputationToPostImages: 10,
    bindNavPrevention: true,
    postfix: "",
    imageUploader: {
    brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
    contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
    allowUrls: true
    },
    noCode: true, onDemand: true,
    discardSelector: ".discard-answer"
    ,immediatelyShowMarkdownHelp:true
    });


    }
    });














    draft saved

    draft discarded


















    StackExchange.ready(
    function () {
    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f1329497%2foptimisation-problem-for-pipe-nesting%23new-answer', 'question_page');
    }
    );

    Post as a guest















    Required, but never shown

























    1 Answer
    1






    active

    oldest

    votes








    1 Answer
    1






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes









    0














    I doubt there is an optimal analytical strategy for solving the problem. You will want to use an optimization approach.



    A naive greedy strategy, which is probably decent, but almost certainly not optimal:




    1. Pack in all the largest pipes. For any given truck, this amounts to a problem of packing as many circles as possible into a square; as Malcolm mentioned in a comment, this problem has been explicitly solved in some cases and numerics probably also exist; see https://en.wikipedia.org/wiki/Circle_packing_in_a_square. Use as few trucks as possible.


    2. Consider the largest kind of pipe that has not been packed in yet. First nest them inside the larger pipes. If pipes still remain, try to fit them into the gaps between the larger pipes; pack as carefully as possible. This is a matter of packing circles into an arbitrary bounded area and optimization literature might exist, but explicit solutions almost certainly will not. You can do this one truck at a time. If there are still pipes of the same size remaining, add new trucks; this reduces to step 1., above.


    3. Repeat step 2 for all pipe sizes.



    A naive, and not efficient, optimization method would be to remove a pipe (and all nested pipes) of a given size and then try to fit two or more smaller ones into the hole. You should first fill all the trucks with the naive method and then check what size of pipes are in the final one; these are the ones you will want to pack more effectively.



    Suppose there are at least two trucks filled with pipes of the critical size. Try removing pipes larger than that from other trucks and replacing them with pipes of the critical size. Take the most empty truck with critical pipes as the one you are trying to empty. Into the other(s) you will try to insert the pipes you have removed from elsewhere.



    This would be cumbersome, so probably just stick with the naive algorithm.






    share|cite|improve this answer


























      0














      I doubt there is an optimal analytical strategy for solving the problem. You will want to use an optimization approach.



      A naive greedy strategy, which is probably decent, but almost certainly not optimal:




      1. Pack in all the largest pipes. For any given truck, this amounts to a problem of packing as many circles as possible into a square; as Malcolm mentioned in a comment, this problem has been explicitly solved in some cases and numerics probably also exist; see https://en.wikipedia.org/wiki/Circle_packing_in_a_square. Use as few trucks as possible.


      2. Consider the largest kind of pipe that has not been packed in yet. First nest them inside the larger pipes. If pipes still remain, try to fit them into the gaps between the larger pipes; pack as carefully as possible. This is a matter of packing circles into an arbitrary bounded area and optimization literature might exist, but explicit solutions almost certainly will not. You can do this one truck at a time. If there are still pipes of the same size remaining, add new trucks; this reduces to step 1., above.


      3. Repeat step 2 for all pipe sizes.



      A naive, and not efficient, optimization method would be to remove a pipe (and all nested pipes) of a given size and then try to fit two or more smaller ones into the hole. You should first fill all the trucks with the naive method and then check what size of pipes are in the final one; these are the ones you will want to pack more effectively.



      Suppose there are at least two trucks filled with pipes of the critical size. Try removing pipes larger than that from other trucks and replacing them with pipes of the critical size. Take the most empty truck with critical pipes as the one you are trying to empty. Into the other(s) you will try to insert the pipes you have removed from elsewhere.



      This would be cumbersome, so probably just stick with the naive algorithm.






      share|cite|improve this answer
























        0












        0








        0






        I doubt there is an optimal analytical strategy for solving the problem. You will want to use an optimization approach.



        A naive greedy strategy, which is probably decent, but almost certainly not optimal:




        1. Pack in all the largest pipes. For any given truck, this amounts to a problem of packing as many circles as possible into a square; as Malcolm mentioned in a comment, this problem has been explicitly solved in some cases and numerics probably also exist; see https://en.wikipedia.org/wiki/Circle_packing_in_a_square. Use as few trucks as possible.


        2. Consider the largest kind of pipe that has not been packed in yet. First nest them inside the larger pipes. If pipes still remain, try to fit them into the gaps between the larger pipes; pack as carefully as possible. This is a matter of packing circles into an arbitrary bounded area and optimization literature might exist, but explicit solutions almost certainly will not. You can do this one truck at a time. If there are still pipes of the same size remaining, add new trucks; this reduces to step 1., above.


        3. Repeat step 2 for all pipe sizes.



        A naive, and not efficient, optimization method would be to remove a pipe (and all nested pipes) of a given size and then try to fit two or more smaller ones into the hole. You should first fill all the trucks with the naive method and then check what size of pipes are in the final one; these are the ones you will want to pack more effectively.



        Suppose there are at least two trucks filled with pipes of the critical size. Try removing pipes larger than that from other trucks and replacing them with pipes of the critical size. Take the most empty truck with critical pipes as the one you are trying to empty. Into the other(s) you will try to insert the pipes you have removed from elsewhere.



        This would be cumbersome, so probably just stick with the naive algorithm.






        share|cite|improve this answer












        I doubt there is an optimal analytical strategy for solving the problem. You will want to use an optimization approach.



        A naive greedy strategy, which is probably decent, but almost certainly not optimal:




        1. Pack in all the largest pipes. For any given truck, this amounts to a problem of packing as many circles as possible into a square; as Malcolm mentioned in a comment, this problem has been explicitly solved in some cases and numerics probably also exist; see https://en.wikipedia.org/wiki/Circle_packing_in_a_square. Use as few trucks as possible.


        2. Consider the largest kind of pipe that has not been packed in yet. First nest them inside the larger pipes. If pipes still remain, try to fit them into the gaps between the larger pipes; pack as carefully as possible. This is a matter of packing circles into an arbitrary bounded area and optimization literature might exist, but explicit solutions almost certainly will not. You can do this one truck at a time. If there are still pipes of the same size remaining, add new trucks; this reduces to step 1., above.


        3. Repeat step 2 for all pipe sizes.



        A naive, and not efficient, optimization method would be to remove a pipe (and all nested pipes) of a given size and then try to fit two or more smaller ones into the hole. You should first fill all the trucks with the naive method and then check what size of pipes are in the final one; these are the ones you will want to pack more effectively.



        Suppose there are at least two trucks filled with pipes of the critical size. Try removing pipes larger than that from other trucks and replacing them with pipes of the critical size. Take the most empty truck with critical pipes as the one you are trying to empty. Into the other(s) you will try to insert the pipes you have removed from elsewhere.



        This would be cumbersome, so probably just stick with the naive algorithm.







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered yesterday









        Tommi Brander

        956922




        956922






























            draft saved

            draft discarded




















































            Thanks for contributing an answer to Mathematics Stack Exchange!


            • Please be sure to answer the question. Provide details and share your research!

            But avoid …



            • Asking for help, clarification, or responding to other answers.

            • Making statements based on opinion; back them up with references or personal experience.


            Use MathJax to format equations. MathJax reference.


            To learn more, see our tips on writing great answers.





            Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


            Please pay close attention to the following guidance:


            • Please be sure to answer the question. Provide details and share your research!

            But avoid …



            • Asking for help, clarification, or responding to other answers.

            • Making statements based on opinion; back them up with references or personal experience.


            To learn more, see our tips on writing great answers.




            draft saved


            draft discarded














            StackExchange.ready(
            function () {
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f1329497%2foptimisation-problem-for-pipe-nesting%23new-answer', 'question_page');
            }
            );

            Post as a guest















            Required, but never shown





















































            Required, but never shown














            Required, but never shown












            Required, but never shown







            Required, but never shown

































            Required, but never shown














            Required, but never shown












            Required, but never shown







            Required, but never shown







            -

            Popular posts from this blog

            An IMO inspired problem

            Image
            14 4 This problem from IMO 1988 is said to be one of the most elegant ones in functional equations. Problem : The function $f$ is defined on the set of all positive integers as follows: begin{align} f(1) = 1, f(3) &= 3, f(2n) = f(n), \ f(4n+1) &= 2f(2n+1) - f(n), \ f(4n+3) &= 3 f(2n+1) - 2f(n) end{align} Find the number of $n$ with $f(n) = n, 1 leq n leq 1988$. The main idea towards the solution is realizing that these conditions stand for the fact that $f(n)$ just reverses the digits in the binary representation of the number $n$. So, essentially the solution is finding the number of binary pallindromes $leq 1988_{10}$. My question is the following : How to reformulate the problem so that $f(n)$ reverses the digits of $n$ in its ternary representation. Or even better, can we reformulate it for a
            Read more

            Management

            Image
            Management From Wikipedia, the free encyclopedia Jump to navigation Jump to search "Manager" redirects here. For other uses, see Management (disambiguation) and Manager (disambiguation). An organization chart for the United States Coast Guard shows the hierarchy of managerial roles in that organization. Business administration Management of a business Accounting Management accounting Financial accounting Financial audit Business entities Cooperative Corporation Limited liability company Partnership Sole proprietorship State-owned enterprise Corporate governance Annual general meeting Board of directors Supervisory board Advisory board Audit committee Corporate law Commercial law Constitutional documents Contract Corporate crime Corporate liability Insolvency law International trade law Mergers and acquisitions Economics Commodity Pu
            Read more

            Investment

            Image
            Investment From Wikipedia, the free encyclopedia Jump to navigation Jump to search This article is about investment in finance. For investment in macroeconomics, see Investment (macroeconomics). For other uses, see Investment (disambiguation). "Invest" redirects here. For the term in meteorology, see Invest (meteorology). This article needs additional citations for verification . Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. ( February 2017 ) (Learn how and when to remove this template message) In general, to invest is to distribute money in the expectation of some benefit in the future – for example, investment in durable goods, in real estate by the service industry, in factories for manufacturing, in product development, and in research and development. However, this article focuses specifically on investment in financial
            Read more