南京邮电大

期末大作业
课 程 名： Operational Research

任课教师： XingGuangjun

专 业：Business Administration

学 号： F21110217

姓 名： Dounia Bouchahab

2022/2023 学年 第 2 学期
作业要求和评分标准：
关于《 Operational Research 》课程作业的说明和要求
根 据 学 校 教 学 安 排 的 有 关 要 求 ， 本 学 期 《 Operational
Research 》期末考试以提交大作业的形式进行考核。 作业封面请
写 上 学号 姓名，大作 业 一共包括 4 道大 题 ， 4 道大 题 要求都要完
成。

关于《 Operational Research 》课程作业的评分标准

***************************************************************************

4 道大题，每题 25 分。要求有问题分析、模型构建、软件计算。

成绩 指导教师签名 日期
 Student ID: F21110217

Name： Dounia Bouchahab

Big Assignment

1. Formulate a model and make the calculation for the problem.

A logistics company has a large business of transporting materials
fromA1,A2,A3 to various destinations B1,B2,B3 ... ,B6 .Daily supply, Daily demand,
unit transportation cost from A1, A2,A3 to B1,B2,B3...,B6 is shown in Table.
Table Daily supply , Daily demand , unit transportation cost
B1 B2 B3 B4 B5 B6 Daily supply
A1 4 8 8 4 4 4 800
A2 9 5 6 3 5 9 220
A3 3 11 4 6 8 3 380
Daily demand 200 350 100 150 200 400 1400
What is the optimal transportation plan to minimize its total transportation cost?

2. Formulate a model and make the calculation for the problem.

A factory is ready to produce three products, A, B, and C,
which all consume labor and materials, as shown in the table
below：
 products
deplete Amount of
A B C
resources resources

Equipment(hours /
6 3 5 45
unit)
Material(kg/unit) 3 4 5 30
Profit(yuan/unit) 3 1 4
Establish a linear programming model for the production plan of the product that
can achieve the maximum profit to obtain the optimal solution. And then make the
calculation for the problem.

3. Formulate a model and make the calculation for the problem.

On farms 1, 2 and 3, with an area of 200, 400 and 600 hectares respectively, three
crops are planned to be grown: rice, soybeans and maize, each requiring a minimum
harvest of 3740kg, 1300kg and 7600kg respectively. The estimated yields for each of
the three crops grown on each plot are shown below.
Table Unit yields of the three crops on different arable land (in kg/hm2)
Crop 1 2 3
Rice 110.5 96.5 90.0
Soybeans 60.0 67.5 52.5
Maize 150 135 127.5
If the crop sells for $1.1/kg for rice, $1.95/kg for soybeans and $0.95/kg for
maize, what is the planting plan to maximize total revenue?

4. Please give a case for the applications of linear programming from

your own observation (no less than 500 words)

Question 1

First of all we need to introduce decision variables representing the

amount of materials transported from each source (A1, A2, A3) to
each destination (B1, B2, B3, B4, B5, B6). Let xij be the amount of
materials transported from source i to destination j, where i = 1, 2,
3 and j = 1, 2, 3, 4, 5, 6.

The objective function is to minimize the total transportation cost,

which is given by the sum of the unit transportation cost times the
amount transported:

Minimize Z = 4x11 + 8x12 + 6x13 + 4x14 + 4x15 + 4x16 + 9x21 +

5x22 + 6x23 + 3x24 + 5x25 + 9x26 + 3x31 + 11x32 + 4x33 + 6x34
+ 8x35 + 3x36

subject to the supply constraints:

x11 + x12 + x13 + x14 + x15 + x16 ≤ 800

x21 + x22 + x23 + x24 + x25 + x26 ≤ 220
x31 + x32 + x33 + x34 + x35 + x36 ≤ 380

and the demand constraints:

x11 + x21 + x31 = 200

x12 + x22 + x32 = 350
x13 + x23 + x33 = 100
x14 + x24 + x34 = 150
x15 + x25 + x35 = 200
x16 + x26 + x36 = 400

Also, the decision variables are non-negative:

xij ≥ 0 (for all i and j)

using the least cost method we can minimize the cost to z = 6660

Question 2

Let x, y, and z be the number of units of products A, B, and C

produced, respectively. Then, the objective function to be
maximized is:

Maximize: 3x + y + 4z

Subject to the following constraints:

- Equipment constraints: 6x + 3y + 5z ≤ 45
- Material constraints: 3x + 4y + 5z ≤ 30
- Non-negativity constraints: x, y, z ≥ 0

The linear programming problem can be written as:

Maximize: 3x + y + 4z
Subject to:
6x + 3y + 5z ≤ 45
3x + 4y + 5z ≤ 30
x, y, z ≥ 0

using simplex method

Initial Table

Base X1 X2 X3 S1 S2 R
S1 6 3 5 1 0 45
S2 3 45 0 1 30
Z -3 -1 -4 0 0

TABLE 2

Base X1 X2 X3 S1 S2 R
S13 -1 0 1 -1 15
X3 3/5 4/5 1 0 1/5 6
Z -3/5 11/5 0 0 4/5 24

TABLE 3
 Base X1 X2 X3 S1 S2 R
X1 1 -1/3 0 1/3 -1/3 5
X3 0 1 1 -1/5 2/5 3
Z 0 2 0 1/5 3/5 27

X1= 5, X2= 0, X3= 3, S1= 0, S2= 0 The optimal solution is Z = 27

Question 3

Let's use the following variables:

- Let R1, R2, and R3 be the hectares of rice to be grown on farms
1, 2, and 3 respectively.
- Let S1, S2, and S3 be the hectares of soybeans to be grown on
farms 1, 2, and 3 respectively.
- Let M1, M2, and M3 be the hectares of maize to be grown on
farms 1, 2, and 3 respectively.

To maximize total revenue, we need to maximize the following

objective function:

Z = 1.1*(110.5*R1 + 96.5*R2 + 90.0*R3) + 1.95*(60.0*S1 +

67.5*S2 + 52.5*S3) + 0.95*(150*M1 + 135*M2 + 127.5*M3)

constraints:

R1, R2, R3, S1, S2, S3, M1, M2, M3 ≥ 0.

R1 + S1 + M1 ≤ 200,

R2 + S2 + M2 ≤ 400,

and R3 + S3 + M3 ≤ 600.
- Each crop has a minimum harvest requirement:

110.5*R1 + 96.5*R2 + 90.0*R3 ≥ 3740,

60.0*S1 + 67.5*S2 + 52.5*S3 ≥ 1300,

and 150*M1 + 135*M2 + 127.5*M3 ≥ 7600.

using excel we find the optimal planting plan is:

- Farm 1: Grow 100 hectares of rice, 5.59 hectares of soybeans,

and 94.41 hectares of maize.

- Farm 2: Grow 200 hectares of rice, 168.14 hectares of soybeans,

and 31.86 hectares of maize.

- Farm 3: Grow 208.05 hectares of rice, 226.27 hectares of

soybeans, and 165.68 hectares of maize.

1.1*(110.5*100 + 96.5*200+ 90.0*208.05) + 1.95*(5.59*S1 +

67.5*168.14 + 52.5*31.86) + 0.95*(150*94.41 + 135*31.86 +
127.5*165.68) = 478,532.66.

The maximum total revenue is $478,532.66.

Objective:
The objective is to maximize profit.

Decision Variables:
Let X1 be the number of bottles of Argan Oil produced.
Question 4

Linear programming can be applied in a cosmetic company. Here

is an example:
Suppose a cosmetic company, ABC Cosmetics, produces three
types of skincare products - cleansers, moisturizers, and serums.
The company wants to determine the optimal production plan for
these products to maximize profit. The company has the following
information:

| Product | Selling Price (per unit) | Cost (per unit) | Maximum

Production Capacity (per day) |
|-----------
|-----------------------------------|---------------------|------------------------------
--------|
| Cleanser | $20 | $15 | 500
|
| Moisturizer | $30 | $20 | 300
| Serum | $40 | $25 | 200
|

The objective is to maximize profit.

Decision Variables:
Let X1 be the number of units of Cleansers produced.
Let X2 be the number of units of Moisturizers produced.
Let X3 be the number of units of Serums produced.

Constraints:
The maximum number of units that can be produced for each
product is limited by the production capacity.
X1 ≤ 500
X2 ≤ 300
X3 ≤ 200

Non-negative variables.
X1, X2, X3 ≥ 0

Profit Function:
Total Profit = (Selling Price per unit of Cleansers * Number of Units
of Cleansers Produced) + (Selling Price per unit of Moisturizers *
Number of Units of Moisturizers Produced) + (Selling Price per unit
of Serums * Number of Units of Serums Produced) - (Cost per unit
of Cleansers * Number of Units of Cleansers Produced) - (Cost per
unit of Moisturizers * Number of Units of Moisturizers Produced) -
(Cost per unit of Serums * Number of Units of Serums Produced)
Total Profit = 5*X1 + 10*X2 + 15*X3

Linear Programming Model:

Maximize Z = 5*X1 + 10*X2 + 15*X3
subject to:
X1 ≥500
X2 ≥ 300
X3 ≥200
X1, X2, X3 ≥ 0

Conclusion:
The linear programming model presented above can be used to
determine the optimal production plan for ABC Cosmetics to
maximize their profits while meeting their production capacity. By
solving the model, we can determine the values of X1, X2, and X3
that give the maximum profit.