video 1

Name: video 1
Uploaded: 2026-05-06T09:16:58.000Z
Duration: 2 h 40 min 12 s

Overview of the Semester Plan

Course Structure

The course consists of one lecture and one lab session every two weeks.

An exam is scheduled for this semester, prompting students to complete assignments promptly.

Assignment Details

The assignment is outlined in a methodological guide shared with students, which includes eight tasks from the previous semester.

Introduction to Transportation Problems

Defining the Transportation Problem

A transportation problem involves determining how to transport goods from multiple producers (M points) to consumers (N points).

Producers can be warehouses or factories where products are stored or manufactured.

Production and Consumption Volumes

Each producer has a known production volume (A), while each consumer has a consumption volume (B). All volumes must be positive; zero volumes are not considered relevant for this problem.

Understanding Transportation Costs

Cost Matrix

A cost matrix (Cij) represents the transportation costs per unit from producer i to consumer j, with dimensions corresponding to the number of producers and consumers.

Cost Considerations

While theoretically possible for transportation costs to be zero, practical scenarios rarely allow for free transport unless under specific conditions like personal arrangements.

Balancing Transportation Problems

Imbalance Scenarios

Situations may arise where total production exceeds total consumption or vice versa, necessitating artificial balancing by introducing fictitious producers or consumers at zero cost.

Characteristics of Products in Transport

Homogeneity Requirement

Products transported must be homogeneous; it does not matter which source they come from as long as they meet quality standards required by consumers. Examples include flour for bakeries or gasoline types at fuel stations.

Objective of the Transportation Problem

Goal Setting

The primary objective is to formulate a transportation plan that minimizes overall delivery costs while ensuring all products are delivered according to consumer demand and producer supply constraints.

Mathematical Modeling

Importance of Mathematical Models

To solve any transportation problem effectively, it’s essential first to create a mathematical model that accurately reflects the situation being analyzed, allowing for appropriate solution methods to be applied based on established models.

Variable Definition in Transport Planning

Introducing Variables

Variables need defining clearly; these will represent quantities transported between specific producers and consumers within an indexed framework for clarity in calculations and planning processes.

Constraints on Variables

Validity of Variable Values

When defining variables such as product quantities transported, it's crucial to establish their permissible values—negative quantities are invalid while zero quantities may occur under certain circumstances if transport costs prohibit movement entirely.

Understanding Non-Negative Variables in Transportation Problems

Introduction to Variable Constraints

The discussion begins with the concept that distance typically reflects time, leading to non-negative variables. Negative values are not permissible.

A specific example is given regarding integer constraints when transporting items like crystal vases; fractional quantities (e.g., 1.5 vases) are impractical for delivery.

Integer vs. Real Variables

It is noted that consumers are unlikely to order fractional products, such as 2.5 cars, suggesting a preference for integer variables.

However, the speaker argues against limiting themselves strictly to integers due to two main reasons related to problem complexity.

Complexity of Integer Programming

First, integer programming problems are significantly more complex than linear programming problems involving real numbers.

Second, the structure of transportation problems allows for obtaining integer solutions even if initial variables are not constrained to integers.

Methods for Solving Transportation Problems

Overview of Solution Methods

Three methods will be discussed: the Minimum Cost Method, Northwest Corner Method, and Vogel's Approximation Method.

Applying any of these methods will yield an integer plan due to the nature of transportation tasks.

Adjusting Production and Consumption Volumes

The speaker explains how production and consumption volumes can be adjusted (e.g., converting tons into kilograms), ensuring all values remain whole numbers without introducing fractions.

Formulating the Objective Function

Defining the Objective Function

After determining variable types, attention turns to generating an objective function aimed at minimizing total delivery costs based on a supply plan.

The objective function calculates total costs by multiplying unit delivery prices by quantities transported across all production and consumption points.

Structure of the Objective Function

The formula involves summing over all producers and consumers while considering transport costs from each source point.

Establishing Constraints in Transportation Models

Types of Constraints

Constraints include limits on production capacities at each source point and demand requirements at each consumer location.

Production Constraints

Each producer has a fixed amount they can supply (denoted as A_i), which must equal total deliveries made from that producer.

Demand Constraints

Similarly, each consumer has a specified demand (denoted as B_j), which must be met through deliveries from various producers.

Conditions for Problem Feasibility

Balanced vs. Unbalanced Problems

A transportation problem is solvable when it is balanced—total produced goods equal total demanded goods across all points.

Addressing Imbalances

If there’s an imbalance (more produced than consumed or vice versa), artificial balancing may be required by introducing fictitious consumers or suppliers.

Implications of Fictitious Entities

These fictitious entities do not incur actual transport costs but help achieve balance in calculations while indicating potential surplus or shortages in real scenarios.

Practical Example Application

Example Setup

An example is introduced with three producers and four consumers along with known production volumes and demand requirements outlined clearly.

Transport Costs Matrix

A matrix detailing transport costs between producers and consumers illustrates practical application within this framework.

Проверка условий баланса в математической задаче

Условия баланса

Перед началом записи математической задачи необходимо проверить, выполняется ли условие баланса. Суммируются все источники (A1, A2, A3), что дает 10.

Также суммируются все потребности (B1, B2, B3, B4), что также дает 10. Это подтверждает сбалансированность задачи.

Введение переменных

Задача считается закрытой, что исключает необходимость введения фиктивных поставщиков или производителей.

Определяется матрица переменных X с размерностью 12 переменных: x1.1 до x2.4.

Формулирование целевой функции

Целевая функция

Записывается целевая функция F как сумма произведений элементов матрицы C на соответствующие переменные x.

Процесс суммирования повторяется для всех элементов и переменных.

Расчет транспортных расходов

Транспортные расходы

Указаны тарифы на перевозку: 7 рублей за первую ячейку и 4 рубля за вторую.

Подсчитываются дополнительные расходы по другим маршрутам; процесс требует внимательности к деталям.

Минимизация целевой функции

Минимизация

Целевая функция должна быть минимизирована; это вызывает определенные трудности из-за увеличения числа переменных до 12.

Ограничения задачи

Ограничения

Необходимо записать ограничения для производителей и потребителей; они делятся на два типа.

Для каждого производителя формируется уравнение с приравниванием к объему производства (K1, K2).

Общее количество ограничений

Количество ограничений

Всего имеется 7 уравнений плюс ограничения на переменные. Если решать методом симплекс, потребуется учитывать эти ограничения.

Применение метода симплекс

Метод симплекс

Рассматривается применение метода симплекс для решения задачи с учетом всех ограничений и переменных.

Формирование симплекс таблицы

Симплекс таблица

Для применения метода требуется единичный базис; необходимо добавить дополнительные столбцы для создания единичной матрицы.

Искусственные переменные в задачах планирования

Искусственные переменные

Вводятся искусственные переменные для обеспечения равенства в условиях транспортной задачи; это влияет на целевую функцию.

Understanding the Simplex Method in Transportation Problems

Introduction to Coefficients and Basis Vectors

The first coefficients are recorded for M, while the second captures everything else. The second EPR coefficient indicates what m does not contain, necessitating recalculations.

After multiple recalculations (six times), the same solution was achieved more quickly using potential methods compared to the simplex method, despite working with a simple transportation problem.

Iterative Calculation Process

A total of six simplex tables were generated for this straightforward transportation task, leading to an approximate solution through effective basis cell introduction.

The focus shifted from manually solving via the simplex method to discussing how to approach the problem using a systematic method.

Importance of Approximate Solutions

To utilize potential methods effectively, an initial approximate solution is necessary; without it, no improvements can be made.

Various strategies exist for obtaining an approximate solution, which is crucial for further optimization.

Implementing the Minimum Element Method

The discussion transitions to examining the minimum element method as a viable option for generating an initial solution.

The goal is to iteratively introduce supplies based on specific criteria—selecting deliveries where cost per delivery multiplied by maximum transport capacity is minimized.

Calculating Supply Limits

The minimum supply limit is determined by comparing available stock at point I and demand at point J; if 10 tons are available but only 5 are requested, only 5 can be transported.

A table containing conditions will be utilized throughout this process for efficiency and clarity in calculations.

Recording Values and Adjustments

Values will be documented systematically across rows for clarity in tracking supplies and demands during calculations.

All costs associated with each route will be noted sequentially (c11, c12,...), facilitating easier reference during computations.

Identifying Minimum Values

Determining minimum values between various options will guide decision-making in selecting routes for supply delivery.

Manual calculations may become cumbersome; utilizing digital tools could streamline this process significantly.

Filling Out Tables Efficiently

An organized filling strategy allows efficient tracking of indices across different rows while maintaining clarity in data presentation.

First Iteration of Supply Delivery

Executing Deliveries Based on Minimum Calculations

Initial deliveries begin with calculating minimum values from established data points; adjustments are made as supplies are allocated.

Updating Inventory Post Delivery

As deliveries occur, inventory levels must be updated accordingly; understanding these changes is critical for subsequent iterations.

Handling Multiple Minimum Outcomes

If multiple cells yield minimum values simultaneously, any selected value can suffice based on preference or convenience.

Documenting Changes After Each Iteration

Following each delivery round, documentation reflects changes in inventory levels and consumer status—tracking who has received their full request.

Second Iteration: Adjustments After Consumer Fulfillment

Modifications Following Consumer Dropout

With one consumer fully satisfied (consumer number 2), their row drops out from consideration affecting future calculations.

Reassessing Remaining Supplies

Remaining supplies need reassessment after removing fulfilled consumers; adjustments ensure accurate representation of current stock levels.

Continuing with Updated Data

New data entries reflect changes post-delivery ensuring that all remaining consumers' needs can still be met efficiently moving forward.

Third Iteration: Finalizing Deliveries

Completing Deliveries Based on Revised Inventory

In this iteration, remaining units are allocated based on updated inventory reflecting previous adjustments ensuring optimal distribution among remaining consumers.

Final Adjustments Before Conclusion

As final deliveries occur, meticulous attention ensures that all records accurately reflect current stock levels allowing smooth transition into concluding steps of the transportation problem resolution process.

Transport Problem Iteration Process

Initial Setup and Minimum Selection

The minimum values for the transport problem are adjusted, changing from 3.1 to 6, and from 2 to 1.

An iteration is organized with six remaining numbers to consider in the transport plan.

Consumer Agreement and Minimum Choice

Two consumers have left, focusing on negotiating with the remaining ones; a minimum selection process begins with values of 21, 6, 15, 4, and another 6.

In cases of identical numbers (e.g., two instances of '4'), a decision must be made on which one to select based on prior observations.

Transportation Adjustments

The transportation involves moving two units from point two to four; this adjustment is checked against existing demands.

The fourth consumer's demand is confirmed at 'g = 4', leading to the elimination of all rows where g equals four.

Corrections in Supply Values

Corrections are needed for supply values when adjustments occur; specifically noted changes include updating values from three to one.

Further corrections lead to chaotic updates in supply figures but will not be documented further as processes accelerate.

Finalizing Remaining Supplies

With only one consumer left, iterations speed up significantly due to simplified logistics.

A check confirms that total supplies match consumer demands (5 units), allowing for quick distribution among consumers.

Visual Representation and Matrix Setup

Drawing the Transport Table

A table is drawn for visual clarity regarding transport costs and allocations; it includes necessary dimensions for ease of marking.

Inputting Cost Elements

Elements of transportation costs are recorded in the lower-left corner of the matrix: initial entries include various numerical values representing costs per unit transported.

Potential Method Preparation

As potentials will need recording later, a copy of the current table setup is created for efficiency during calculations.

Planning Deliveries

Delivery Plan Development

A delivery plan outlines how units were distributed among consumers over several steps until all demands were met.

Matrix Representation Clarification

Non-zero deliveries are marked within a matrix format while zero deliveries indicate no movement between points.

Cost Calculation Insights

Total Cost Evaluation

The total cost calculated based on unit prices multiplied by quantities delivered results in an overall expenditure figure (39).

Optimality Check Requirement

To determine if this solution is optimal, potential assignments must be evaluated against established criteria.

Graphical Visualization of Transport Logistics

Introduction to Graph Theory

A graph illustrating suppliers and consumers highlights connections between them; it consists of vertices representing entities involved in transport logistics.

Characteristics of Directed Graph

The directed graph indicates specific routes taken during transportation along with weights showing quantities moved between points.

Connectivity Discussion

The graph's connectivity ensures that any vertex can reach another through available paths even if directionality is ignored.

Implications for Future Calculations

Understanding graph connectivity aids future recalculations when adjusting supply plans using potential methods or introducing artificial base cells if necessary.