About Operations Research exercises, can anyone help me solve them?

This question is calculated according to the expected value criterion:

If the nth loaf of bread is sold normally, the profit is a = yuan, and if it is disposed of, the loss is b = yuan.

If the daily market demand is x the profit expectation of the nth loaf of bread.

rn = ap(x>=n) -a+b)p(x<=n-1)a - a+b）p(x<=n-1）

rn>0, i.e., p(x<=n-1)e(n)=an-(a+b) (the sum of all p(x<=n-1), where n is 1 to n).

The specific application to this question is:

a= b= a/(a+b)=

then by. x │ 100 150 200 300 │p(x)│

q(x<=x)|

q(x<=150) "200 should be purchased, and the maximum profit is.

e=。2+RMB).

The optimal purchase quantity is 200 pcs.

Summary. Hello! Dear, the answer to the first question is as follows:

Let the decision variable of whether to select project j be xj, j=1, 2,..7。The problem can be represented by the following integer linear programming model:

max sum_^7 cj* -x2 >=0x2 - x1 >=0x3 + x4 >=1x5 + x6 + x7 = 2xj \in ，j=1,2,..7 where the first constraint indicates that if item 1 is selected, item 2 must be selected at the same time; The second constraint means that if item 2 is selected, item 1 must be selected as well; The third constraint indicates that at least one of items 3 and 4 should be chosen; The fourth constraint indicates that exactly 2 of items 5, 6, and 7 must be selected. The objective function is the sum of the expected returns, i.e., the maximization of the expected returns.

Hello! The answer to the first question is as follows: Let the decision variable of whether to choose item J be xj, J=1, 2,..

7。The problem can be represented by the following integer linear programming model: max sum 7 cj* -x2 >=0x2 - x1 >=0x3 + x4 >=1x5 + x6 + x7 = 2xj in ,j=1,2,..

7 The first constraint indicates that if item 1 is selected, item 2 must be selected at the same time; The second constraint means that if item 2 is selected, item 1 must be selected as well; The third constraint indicates that at least one of items 3 and 4 should be chosen; The fourth constraint indicates that exactly 2 of items 5, 6, and 7 must be selected. The objective function is the sum of the expected returns, i.e., the maximization of the expected returns.

The answer is here [Operations Research Management Report.

I'll tell you, ask Zhou Ya to go.

No, it won't. Together, we haven't learned it. Kiss...

The ad is very long, and I didn't create this ad.

Branch 1 transports 250 boxes to B and 50 boxes to C (or D).

2 branch factories transport 400 boxes to place A.

Branch 3 transports 300 boxes (or 350 boxes) to C and 200 boxes (or 150 boxes) to D.

Question 1: <>

Answer: <>

Question 2: <>

Answer: <>

Question 3: <>

Answer: <>

Question 4: <>

Answer: <>

<> a bit of a mess ......But it should be done this way.

You can take a look at it on the homework help.