Home > Operation Research calculators > Formulate linear programming model example

0. Formulate linear programming model example ( Enter your problem )
  1. General structure of Linear programming problem
  2. Example-1
  3. Example-2
  4. Example-3
  5. Example-4
  6. Example-5
  7. Example-6
  8. Example-7
  9. Example-8
Other related methods
  1. Formulate linear programming model
  2. Graphical method
  3. Simplex method (BigM method)
  4. Two-Phase method
  5. Primal to dual conversion
  6. Dual simplex method
  7. Integer simplex method
  8. Branch and Bound method
  9. 0-1 Integer programming problem
  10. Revised Simplex method

3. Example-2
(Previous example)
5. Example-4
(Next example)

4. Example-3





A company owns two flour mills A and B, which have different production capacities for high, medium and low quality flour. The company has entered a contract to supply flour to a firm every month with at least 8, 12 and 24 quintals of high, medium and low quality respectively. It costs the company Rs 2000 and Rs 1500 per day to run mill A and B respectively. In one day, Mill A produces 6, 2 and 4 quintals of high, medium and low quality flour respectively, Mill B produces 2, 4 and 12 quintals of high, medium and low quality flour respectively. Formulate the linear programming model to Minimize the cost.

Solution:
The contents of the statement of the problem can be summarized as follows
MillABMinRequired
high628
medium2412
low41224

Decision variables
Here flour mills A and B are competing variables and flour quality are available resources.

Let x1 and x2 denotes mills A and B respectively

The LP Model
Here the objective is to minimize the cost

Minimize Z = 2000x1 + 1500x2
Subject to
6x1 + 2x2 ≥ 8
2x1 + 4x2 ≥ 12
4x1 + 12x2 ≥ 24
and x1, x2 ≥ 0



This material is intended as a summary. Use your textbook for detail explanation.
Any bug, improvement, feedback then Submit Here



3. Example-2
(Previous example)
5. Example-4
(Next example)





Share this solution or page with your friends.


 
Copyright © 2023. All rights reserved. Terms, Privacy
 
 

.