The furniture workshop of a factory makes two types of tables, A and B, and each table requires two

Updated on furniture 2024-08-15
8 answers
  1. Anonymous users2024-01-24

    Set up the daily production of A-type table x, B-type table y, the total profit is z thousand yuan, then.

    x+2y≤8

    3x+y≤9

    x≥0,y≥0

    > objective function is: z=2x+3y

    Make a feasible domain:

    Translate the straight line l:2x+3y=0 to the upper right, the straight line passes through the point B on the feasible domain, and the distance from the origin is maximum, then z=2x+3y takes the maximum value and solves the equation.

    x+2y=8

    3x+y=9

    The coordinates of B are (2,3) At this time, z=2 2+3 3=13 (thousand yuan) Answer: 2 A-type tables should be produced every day, and 3 B-type tables should be produced to obtain the maximum profit The maximum profit is 13,000 yuan

  2. Anonymous users2024-01-23

    2 A-type tables and 3 B-type tables should be produced per day in order to obtain the maximum profit, and the maximum profit is 13 thousand yuan.

    Test question analysis: Set up x sheets of A-type tables and y sheets of B-type tables to be produced every day, and the <> of inequality groups can be listed according to the meaning of the questions

    In a planar Cartesian coordinate system, the plane region represented by the group of inequalities is made, and the objective function is <>

    Formed into <>

    When <> changes, it represents a set of parallel lines when the line passes through the feasible domain and is in the <>

    The intercept on the shaft is <> when it is maximum

    Utmost. Based on this, the optimal solution is found and the <> is obtained

    maximum. Question Analysis:

    > solution: If x A-type tables and y B-type tables are produced every day, it will be <>

    > objective function is: z=2x+3y

    Make a feasible domain:

    Put the straight line <>

    2x+3y=0 pan to the top right to <>

    , the straight line passes through the point M on the feasible domain, and the distance from the origin is the largest, and z=2x+3y takes the maximum value.

    Solve the equation <>

    The coordinates of M are (2,3).

    At this point, the maximum profit <>

    Thousand dollars. Answer: 2 A-type tables and 3 B-type tables should be produced every day to get the maximum profit, and the maximum profit is 13,000 yuan.

  3. Anonymous users2024-01-22

    Use linear programming to make A type x sheets, B type y sheets carpentry: x + 2y < = 8

    Painter: 3x+y<=9

    Then, both must be non-negative, so the objective equation of x>=0, y>=0, let z be profit, and z=15x+20y

    Then it is represented by a flat area, and the normal solution is good, and the solution is 2 sheets of type A and 3 sheets of type B, with a profit of 120

  4. Anonymous users2024-01-21

    3 B tables and 2 A tables, carpenters can leave work an hour earlier and can make a profit of 13,000 yuan.

    If it's a math problem, it's bigger than the problem and the conditions are missing!

    If it's factory production, it's your process management problem, and you can't do ...... like that

  5. Anonymous users2024-01-20

    There are 2 pieces of type A and 3 pieces of type B, and the profit is the largest, which is 10,000 yuan. 

    Analysis: Set up a factory to produce X sheets of A-type tables and Y sheets of B-type tables every day, and the profit is z (thousand yuan).The feasible domains are the quadrilateral ABCO interior and boundary. 

    That is, the intercept of the moving straight line on the y axis, and the moving straight line moves in the feasible domain, so that the intercept of the straight line at point B is the largest, and z has the maximum value at this time. 

    zmax=2 2+3 3=13 (thousand yuan).The factory should produce 2 A-type tables and 3 B-type tables per day, which can make the largest profit, which is 13,000 yuan.

  6. Anonymous users2024-01-19

    If x tables of type A and y sheets of table B are produced per day, then the objective function is z=2x 3yMake a feasible domain:

    When the square is translated to the position of l, the straight line passes through the point M on the feasible domain and the distance from the origin is maximum, and the maximum value is obtained at z=2x 3y. Solve the equation to get the coordinates of M as (2,3).A:

    2 Type A tables and 3 Type B tables should be produced per day to obtain maximum profit.

  7. Anonymous users2024-01-18

    Ask your elementary school math teacher.

  8. Anonymous users2024-01-17

    The exam is over、Cup。

Related questions
5 answers2024-08-15

It takes 1 hour and 2 hours for carpenters to make an A and B tables, 3 hours and 1 hour for a painter to paint an A and B tables, and it takes 3 hours and 9 hours for carpenters to work more than 8 hours and 9 hours a day, all of them, and the lacquerers can make 3 A-shaped tables or 9 B-shaped tables per day, and the carpenters can make 8 A-shaped tables or 4 B-shaped tables per day, and if they make 1 A-type table per day, the carpenters can make 3 B-shaped tables and 6 B-shaped tables for the rest of the time. >>>More

1 answers2024-08-15

Some are at No. 4, Changning Heng Road, Wanggang Industrial Zone, Longjiang Town, Shunde District, Foshan City.

2 answers2024-08-15

I can tell you very responsibly that the software on the market today that claims to be automatic order splitting, automatic punching, and one-click generation of drawings are all routines. >>>More

3 answers2024-08-15

First find out how many sets you have made: 400-80=320

How many more days to do: 320 20 = 16 six. >>>More