Simplex and primal dual problem

  • Thread starter retspool
  • Start date
  • Tags
    Dual
In summary, the conversation discusses the need for a link to better understand primal and dual problems in the context of simplex, and the difficulty in finding resources and visualizations. Three potential resources for learning about this topic are mentioned, including a website, a course, and a book. The conversation also mentions a paper that presents a new algorithm for solving bi-objective linear minimum cost network flow problems.
  • #1
retspool
36
0
i need a link which can help me better understand primal and dual problems along with simplex

Any help would be appreciated

Thanks
 
Physics news on Phys.org
  • #2
Last edited by a moderator:
  • #3
In this paper we develop a primal–dual simplex algorithm for the bi-objective linear minimum cost network flow problem. This algorithm improves the general primal–dual simplex algorithm for multi-objective linear programs by Ehrgott et al. (J Optim Theory Appl 134:483–497, 2007). We illustrate the algorithm with an example and provide numerical results.

<spam link deleted>

http://www.springerlink.com/content/uk10q607g0331118/
 
Last edited by a moderator:

1. What is the difference between Simplex and primal dual problem?

The Simplex method is a linear programming algorithm used to solve optimization problems with linear constraints. The primal-dual method is a more general algorithm that can be used to solve both linear and nonlinear optimization problems.

2. How does the Simplex method work?

The Simplex method starts with an initial feasible solution and then iteratively improves it until an optimal solution is found. It does this by moving from one corner of the feasible region to another, always improving the objective function value.

3. What is the purpose of the dual problem in linear programming?

The dual problem is used to find the optimal solution to a linear programming problem by transforming it into a different problem that is easier to solve. It also provides valuable information about the sensitivity of the optimal solution to changes in the problem parameters.

4. How is the primal dual relationship utilized in linear programming?

The primal dual relationship is used to find an optimal solution to a linear programming problem by solving both the primal and dual problems simultaneously. This approach can be more efficient than solving the problems separately.

5. What are some applications of Simplex and primal dual problem?

The Simplex and primal dual problems have a wide range of applications, including resource allocation, production planning, and network flow optimization. They are also used in economics, engineering, and other fields to optimize complex systems and processes.

Similar threads

Convex Optimization: Dual Function Definition
    • Calculus and Beyond Homework Help
Replies
4
Views
1K
Where in STEM can I expect to use dual basis, dual map, annihilator?
    • General Discussion
Replies
2
Views
475
A Anti-self Dual Part (2,2) Riemann Curvature Tensor
    • Special and General Relativity
Replies
2
Views
1K
Null space of dual map of T = annihilator of range T
    • Calculus and Beyond Homework Help
Replies
0
Views
449
A Finding dual optimum of a linear problem
    • General Math
Replies
0
Views
698
Optimization: Formulation of the dual of a semi-definite program (SDP)
    • Calculus and Beyond Homework Help
Replies
1
Views
494
I Rewriting Equation of Motion in terms of Dual Fields (Chern-Simons)
    • Differential Geometry
Replies
2
Views
635
Optimization: Dual for L1 norm minimization with equality constraint
    • Calculus and Beyond Homework Help
Replies
1
Views
558
I Expressing Vectors of Dual Basis w/Metric Tensor
    • Special and General Relativity
Replies
8
Views
2K
I Understanding the concepts of isometric basis and musical isomorphism
    • Linear and Abstract Algebra
Replies
3
Views
2K

Hot Threads

Recent Insights

Back
Top