| Files Posted by Bapi |
View all
|
| Updated |
|
File |
Tags |
Downloads (last 30 days) |
Comments |
Rating |
| 26 Jan 2011 |
|
n-person game The function npg solves an n-person finite non-co-operative game to compute one Nash Equilibrium.
Author: Bapi Chatterjee |
matrix game, nperson game, non co operative game, game theory, optimization, finance |
20 |
0 |
|
| 29 Apr 2010 |
|
Quadratic programming by Wolf's method The function wolf solves a (convex) QPP using Wolf or restricted entry simplex method
Author: Bapi Chatterjee |
wolfs method, qpp, quadratic programming, optimization |
8 |
0 |
|
| 01 Feb 2010 |
|
Revised Simplex Method. The function revised solves an LPP using revised simplex method. It uses big M method.
Author: Bapi Chatterjee |
big m, revised simplex, optimization, linear programming, simplex, lpp |
20 |
0 |
|
| 03 Apr 2009 |
|
DFP quasi Newton method It solves an optimization problem by DFP quasi Newton method.
Author: Bapi Chatterjee |
convex, unconstrained, quasi newton, dfp, finance, maximization |
15 |
3 |
2.5 |
2 ratings
|
| 03 Apr 2009 |
|
Steepest descent method It solves an optimization problem by steepest descent method.
Author: Bapi Chatterjee |
convex, minimization, steepest descent, maximization, finance, mathematical programm... |
34 |
2 |
3.0 |
3 ratings
|
| Files Tagged by Bapi |
View all
|
| Updated |
|
File |
Tags |
Downloads (last 30 days) |
Comments |
Rating |
| 26 Jan 2011 |
|
n-person game The function npg solves an n-person finite non-co-operative game to compute one Nash Equilibrium.
Author: Bapi Chatterjee |
matrix game, nperson game, non co operative game, game theory, optimization, finance |
20 |
0 |
|
| 29 Apr 2010 |
|
Quadratic programming by Wolf's method The function wolf solves a (convex) QPP using Wolf or restricted entry simplex method
Author: Bapi Chatterjee |
wolfs method, qpp, quadratic programming, optimization |
8 |
0 |
|
| 01 Feb 2010 |
|
Revised Simplex Method. The function revised solves an LPP using revised simplex method. It uses big M method.
Author: Bapi Chatterjee |
big m, revised simplex, optimization, linear programming, simplex, lpp |
20 |
0 |
|
| 03 Apr 2009 |
|
DFP quasi Newton method It solves an optimization problem by DFP quasi Newton method.
Author: Bapi Chatterjee |
convex, unconstrained, quasi newton, dfp, finance, maximization |
15 |
3 |
2.5 |
2 ratings
|
| 03 Apr 2009 |
|
Steepest descent method It solves an optimization problem by steepest descent method.
Author: Bapi Chatterjee |
convex, minimization, steepest descent, maximization, finance, mathematical programm... |
34 |
2 |
3.0 |
3 ratings
|
| Files Matching Bapi's Watch List |
View all
|
| Updated |
|
File |
Tags |
Downloads (last 30 days) |
Comments |
Rating |
| 26 Jan 2011 |
|
n-person game The function npg solves an n-person finite non-co-operative game to compute one Nash Equilibrium.
Author: Bapi Chatterjee |
matrix game, nperson game, non co operative game, game theory, optimization, finance |
20 |
0 |
|
| 29 Apr 2010 |
|
Quadratic programming by Wolf's method The function wolf solves a (convex) QPP using Wolf or restricted entry simplex method
Author: Bapi Chatterjee |
wolfs method, qpp, quadratic programming, optimization |
8 |
0 |
|
| 01 Feb 2010 |
|
Revised Simplex Method. The function revised solves an LPP using revised simplex method. It uses big M method.
Author: Bapi Chatterjee |
big m, revised simplex, optimization, linear programming, simplex, lpp |
20 |
0 |
|
| 03 Apr 2009 |
|
DFP quasi Newton method It solves an optimization problem by DFP quasi Newton method.
Author: Bapi Chatterjee |
convex, unconstrained, quasi newton, dfp, finance, maximization |
15 |
3 |
2.5 |
2 ratings
|
| 03 Apr 2009 |
|
Steepest descent method It solves an optimization problem by steepest descent method.
Author: Bapi Chatterjee |
convex, minimization, steepest descent, maximization, finance, mathematical programm... |
34 |
2 |
3.0 |
3 ratings
|
|
Comment only