Maximise profit knowing manufacturing data

Click For Summary
SUMMARY

The discussion focuses on maximizing profit from manufacturing tables and closets using linear programming techniques. The user proposes using a system of equations and the Simplex method to optimize production given constraints on resources. Key equations include 0.2x + 0.1y ≤ 40 and 0.1x + 0.3y ≤ 60, with the objective function being to maximize profit represented by 6x + 8y. The conversation highlights the importance of considering non-negativity conditions and suggests that while graphical methods can be effective, numerical methods like the pivot point method may also be necessary for complex scenarios.

PREREQUISITES
  • Understanding of linear programming concepts
  • Familiarity with the Simplex method for optimization
  • Knowledge of systems of equations and inequalities
  • Basic skills in graphical analysis of functions
NEXT STEPS
  • Study the Simplex method in detail for solving linear programming problems
  • Learn about the graphical method for linear programming and its applications
  • Explore numerical methods for optimization, specifically the pivot point method
  • Investigate the impact of profit margins on production decisions in manufacturing
USEFUL FOR

Manufacturing analysts, operations researchers, and anyone involved in optimizing production processes using linear programming techniques.

prehisto
Messages
111
Reaction score
0

Homework Statement


Hi, this is my data and problem.
http://[ATTACH=full]200209[/ATTACH] [ATTACH=full]200210[/ATTACH]

[h2]Homework Equations[/h2][h2]The Attempt at a Solution[/h2]
So I am thinking that I can use system of equation to get the number of tables and closets for given resources.
0,2x+0,1y=40
0,1x+0,3y=60
1,2x+1,5y=371,4
But this does not include that profit from closets are bigger than from tables.. how can i include that?
 

Attachments

  • PLAIN]%20[Broken].png
    PLAIN]%20[Broken].png
    20.3 KB · Views: 184
  • 2njbyhj.png
    2njbyhj.png
    20.2 KB · Views: 185
Last edited by a moderator:
Physics news on Phys.org
I have another Idea , maybe I can solve ir using Simplex method.
0,2x+0,1y<=40
0,1x+0,3y<=60
1,2x+1,5y<=371,4

and maximize 6x+8y ?
 
prehisto said:
I have another Idea , maybe I can solve ir using Simplex method.
0,2x+0,1y<=40
0,1x+0,3y<=60
1,2x+1,5y<=371,4

and maximize 6x+8y ?
Yes, but do not forget the conditions x>=0, y>=0. Also, it has only 2 variables, so can be solved graphically.
 
Ray Vickson said:
Yes, but do not forget the conditions x>=0, y>=0. Also, it has only 2 variables, so can be solved graphically.
Thanks .
it seems that graphically is not such a good idea because of the scale of graphs.
Although it seems that it will be nasty, I will try to do it numerically by pivot point method ( if it is the correct notation).
 
prehisto said:
Thanks .
it seems that graphically is not such a good idea because of the scale of graphs.
Although it seems that it will be nasty, I will try to do it numerically by pivot point method ( if it is the correct notation).
The graphical method works perfectly well when used as intended: it gives you the information about which two of the five inequalities are equalities at the optimum. Then you have two equations in two unknowns to solve, and doing that gives the exact solution. (The 5 inequalities are the 3 functional inequalities and the two non-negativity conditions.)
 

Similar threads

  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 9 ·
Replies
9
Views
6K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 3 ·
Replies
3
Views
2K
Replies
29
Views
3K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 11 ·
Replies
11
Views
5K
  • · Replies 1 ·
Replies
1
Views
1K
Replies
2
Views
7K