Understanding Linear Equations and the Simplex Method for Function Optimization

  • Context: Undergrad 
  • Thread starter Thread starter Pattielli
  • Start date Start date
  • Tags Tags
    Linear Linear equations
Click For Summary

Discussion Overview

The discussion revolves around understanding the Simplex method for optimizing functions, exploring its application in linear programming, and seeking alternative methods for function optimization. Participants express a desire for simplification and clarity regarding the implementation of these concepts, particularly in programming contexts.

Discussion Character

  • Exploratory
  • Technical explanation
  • Homework-related
  • Debate/contested

Main Points Raised

  • One participant requests help in simplifying the main ideas of the Simplex method and inquires about alternative optimization methods if Simplex is not used.
  • Another participant suggests that the question is too general and recommends posting a specific problem for better assistance.
  • A participant expresses difficulty in understanding how to program an optimization solution with constraints and an objective function, noting that existing resources are overly complex.
  • Some participants mention that heuristic alternatives to the Simplex method exist but may only yield sub-optimal solutions.
  • A graphical solution for linear programming problems with two variables is proposed as a simpler approach, with a note that it can be extended to three variables with knowledge of 3D geometry.
  • It is suggested that understanding the graphical approach could aid in comprehending the Simplex method's functionality.
  • One participant encourages practicing Simplex examples by hand to gain a better understanding of the method.

Areas of Agreement / Disagreement

Participants do not reach a consensus on the best approach to understanding or implementing the Simplex method, with multiple viewpoints on the necessity and effectiveness of alternative methods and the importance of hands-on practice.

Contextual Notes

Some participants highlight the need for specific problem statements to facilitate more targeted assistance. There is also an acknowledgment of the complexity of existing resources, which may hinder understanding.

Who May Find This Useful

This discussion may be useful for individuals seeking to understand the Simplex method, those interested in optimization techniques in programming, and learners looking for simplified explanations of linear programming concepts.

Pattielli
Messages
296
Reaction score
0
I would like to know if anyone of you can help me simplify the main ideas of the Simplex method used to optimize a function...Would you please help me ?

In case which I don't use Simplex to solve the problem, could you tell me if there exist to be any other methods that I can choose ?

Thank you very much,
 
Physics news on Phys.org
Anyone can help ?

Thank you,
 
Probably not. Your question is much too general. It would be better to post a specific problem. It would also be better to post it in "general math" rather than "linear and abstract algebra".
 
Thank you very much...

It is just that i don't understand how to make a program that finds the optimal values subjecting to certain constraints, with a given objective function, there are lots of information on the net and in libraries but they are all hard to understand, they are written long and in a broad sense...I asked this question to only hope that someone who already dealed with these kinds of problems before could give me a more specific and understandable explanation for me to make a computer program...
There is also soure code on the net but I would like to code it myself...

Thanks for your suggestions, and I am sorry for having posted in a wrong forum...
 
Pattielli said:
I would like to know if anyone of you can help me simplify the main ideas of the Simplex method used to optimize a function...Would you please help me ?

In case which I don't use Simplex to solve the problem, could you tell me if there exist to be any other methods that I can choose ?

Thank you very much,

There possibly are heuristic alternatives to the Simplex Algorithm, which can be developed in a case-by-case basis. Of course, they will give only sub-optimal solutions.

For a Linear Programming problem involving only 2 variables, there is a simple graphical solution. I'm sure you will find this in any basic Operations Research / Linear Programming text. This approach can also be extended to a 3 variable case, but it requires a good knowledge of 3D geometry - specifically how to find lines of intersection of 2 planes, etc.

In general, the best way to solve a LP problem is using the Simplex Algorithm - and of course, this works only for Linear problems and not for quadratic, cubic, dynamic (etc.) programming probles. Do not try to avoid the Simplex approach...it is very useful. Understanding the graphical approach could help you understand why Simplex works.

I'm sure this is covered in all Introductory Op. Research books.
 
Last edited:
Have you tried doing some simple simplex examples by hand so that you understand the method? From the way you're writing I suspect not. It is a simple method and if you looked at the teaching resources on say, www.dpmms.cam.ac.uk under the optimisation and control subjects you will get a clear explanation of how to implement it.
 
Thank you Gokul43201 and Matt very much, I truly didn't see Gokul answer this thread of mine till Matt gave me that post...

Matt, yes, I actually didn't solve it by pencil and paper...(smile)

Again thanks both a lot,
Regards,
 
Last edited:

Similar threads

  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 19 ·
Replies
19
Views
4K
  • · Replies 10 ·
Replies
10
Views
3K
Replies
22
Views
6K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 2 ·
Replies
2
Views
11K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 10 ·
Replies
10
Views
4K
  • · Replies 11 ·
Replies
11
Views
2K