Mathematical formulation of Linear Programming Problem

In summary, The problem at hand is to maximize the profit of distributing cargo in a ship with three cargo loads - forward, centre, and after, with given capacity limits of each load. The offered cargoes are A with weight of 6000 tonnes, B with weight of 4000 tonnes, and C with weight of 2000 tonnes. The profit per tonne for each cargo is 150, 200, and 125 Rs, respectively. The weight in each load must be proportional to the capacity in tonne in order to preserve the trim of the ship. The problem is formulated as an LPP model with 9 decision variables and constraints including non-negativity conditions and a constraint for the total weight of cargoes
  • #1
Suvadip
74
0
A ship has three cargo loads -forward, centre and after. The capacity limits are given:

Commodity Weight (in tonne) Volume (in cu. feet)

Forward 2000 100000
Centre 3000 135000
After 1500 30000

The following cargoes are offered. The ship owner may accept all or any part of each commodity:

Commodity Weight (in tonne) Volume (in cu. feet) Profit per tonne (in Rs)

A 6000 60 150
B 4000 50 200
C 2000 25 125 In order to preserve the trim of the ship, the weight in each load must be proportional to the capacity in tonne. The cargo is to be distributed
so as to maximize the profit. Formulate the problem as LPP model.

Please help
 
Mathematics news on Phys.org
  • #2
Can you show us what you have tried so that our helpers know where you are stuck and how best to offer help?
 
  • #3
Hi suvadip!

An LP problem consists of 3 steps:
1. Identify the decision variables.
2. Identify the target function in terms of the decision variables.
3. Identify the constraints.

How far do you get?
 
  • #4
I like Serena said:
Hi suvadip!

An LP problem consists of 3 steps:
1. Identify the decision variables.
2. Identify the target function in terms of the decision variables.
3. Identify the constraints.

How far do you get?

Let x1 tonne of A, x2 tonne of B and x3 tonne of C

Objective function: Max Z=150 x1 +200 x2+125 x3

Constraints:

Non-negativity conditions: x1, x2, x3>=0

Please give me hints about a single constraint. Rest I can do the rest.
 
  • #5
suvadip said:
Let x1 tonne of A, x2 tonne of B and x3 tonne of C

Objective function: Max Z=150 x1 +200 x2+125 x3

Constraints:

Non-negativity conditions: x1, x2, x3>=0

Please give me hints about a single constraint. Rest I can do the rest.

I'm afraid that you have more decisions to make: whether cargo should go forward, center, or aft.

Let $x_{AF}$ be the tonne of A that goes Forward, $x_{BF}$ the tonne of B that goes Forward, and $x_{CF}$ the tonne of C that goes Forward.
In total you will have 9 decision variables.

Then the first constraint is that:
$$x_{AF} + x_{BF} + x_{CF} \le 2000$$

Extra constraints are the non-negativity constraints.
For these 3 decision variables, those are:
$$x_{AF} \ge 0$$
$$x_{BF} \ge 0$$
$$x_{CF} \ge 0$$
 

FAQ: Mathematical formulation of Linear Programming Problem

What is the purpose of mathematical formulation in linear programming?

The purpose of mathematical formulation in linear programming is to convert a real-world problem into a mathematical model that can be solved using mathematical techniques. This allows for a systematic and efficient approach to finding the optimal solution.

What are the key components of a linear programming problem?

The key components of a linear programming problem include the objective function, decision variables, constraints, and the feasible region. The objective function defines the goal to be maximized or minimized, while the decision variables represent the quantities to be determined. The constraints limit the values of the decision variables, and the feasible region is the set of all possible solutions that satisfy the constraints.

How is the objective function determined in linear programming?

The objective function is typically determined by the goals and objectives of the real-world problem being modeled. It can be either a maximization or minimization function and is typically represented by a linear equation.

What is the role of constraints in linear programming?

Constraints play a crucial role in linear programming as they define the limitations and restrictions of the problem. They ensure that the solution obtained is feasible and meets the requirements of the problem. Constraints are represented by linear inequalities or equations.

How is the feasible region determined in linear programming?

The feasible region is determined by graphing the constraints and finding the intersection of their boundaries. This region represents all possible solutions that satisfy the constraints of the problem. The optimal solution is then found within this feasible region.

Similar threads

Replies
17
Views
3K
Replies
4
Views
4K
Replies
1
Views
2K
Back
Top