Rank: 597 based on 206 downloads (last 30 days) and 9 files submitted
photo

Bapi Chatterjee

E-mail
Company/University
Chalmers University of Technology, Sweden

Personal Profile:
Professional Interests:
optimization, game theory, finance, mathematical programming, image processing

 

Watch this Author's files

 

Files Posted by Bapi View all
Updated   File Tags Downloads
(last 30 days)
Comments Rating
04 Sep 2013 Zero Sum Game Solver The script solves a zero sum game problem using linear programming. Author: Bapi Chatterjee optimization, game theory, zerosum game 19 0
26 Jan 2011 Screenshot 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 41 0
  • 5.0
5.0 | 1 rating
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 optimization, quadratic programming, qpp, wolfs method 19 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 optimization, linear programming, lpp, revised simplex, simplex, big m 24 3
  • 2.0
2.0 | 1 rating
03 Apr 2009 Screenshot DFP quasi Newton method It solves an optimization problem by DFP quasi Newton method. Author: Bapi Chatterjee optimization, finance, quasi newton, dfp, unconstrained, maximization 25 3
  • 2.5
2.5 | 2 ratings
Comments and Ratings on Bapi's Files View all
Updated File Comment by Comments Rating
05 Sep 2013 n-person game The function npg solves an n-person finite non-co-operative game to compute one Nash Equilibrium. Author: Bapi Chatterjee Altimiras, Francisco J

25 Jan 2013 Bimatrix Game The bimat.m solves a bimatrix game represented by two matrices M and N . Author: Bapi Chatterjee jalal

25 Oct 2012 Revised Simplex Method. The function revised solves an LPP using revised simplex method. It uses big M method. Author: Bapi Chatterjee Costa, Peter

There is an error !

Undefined function or variable "v".

Error in revised (line 175)
temp=bv(v);bv(v)=nbv(t);

29 Apr 2012 Revised Simplex Method. The function revised solves an LPP using revised simplex method. It uses big M method. Author: Bapi Chatterjee Hakan

Good job, but does not work on some problems.

Works on:
% P = 20x1 + 20x2 + 30x3 --> min.
% 0.06x1 + 0.04x2 + 0.02x3 <= 0.03
% 2x1 + 4x2 + 3x3 <= 3.25
% x1 + x2 + x3 = 1
c = [20, 20, 30];
b = [0.03, 3.25, 1];
a = [0.06, 0.04, 0.02; 2, 4, 3; 1, 1, 1];
inq = [-1, -1, 0];
minimize = 1;
revised(c,b,a,inq,minimize)

Does not work on:
% P = x1 + 8x2 + 9x3 + x4 + 8x5 + 7x6 + 10x7 + 9x8 + 13x9 --> maks.
% x1 + x2 + x3 <= 12e3
% x4 + x5 + x6 <= 10e3
% x7 + x8 + x9 <= 8e3
% x1 + x4 + x7 <= 10e3
% x2 + x5 + x8 <= 12e3
% x3 + x6 + x9 <= 6e3
c = [1, 8, 9, 1, 8, 7, 10, 9, 13];
b = [12e3, 10e3, 8e3, 10e3, 12e3, 6e3];
a = [1, 1, 1, 0, 0, 0, 0, 0, 0
0, 0, 0, 1, 1, 1, 0, 0, 0
0, 0, 0, 0, 0, 0, 1, 1, 1
1, 0, 0, 1, 0, 0, 1, 0, 0
0, 1, 0, 0, 1, 0, 0, 1, 0
0, 0, 1, 0, 0, 1, 0, 0, 1];
% inq = -ones(1,6);
% minimize = 0;
revised(c, b, a)

It gives the error:
Undefined function or variable "v".

Error in revised (line 175)
temp=bv(v);bv(v)=nbv(t);

varibale "v" stays undefined in some conditions.

Anyway, thanks for the effort.

18 Mar 2012 Steepest descent method It solves an optimization problem by steepest descent method. Author: Bapi Chatterjee Jacob

I am new to MatLab and was wondering how would I enter the following function in "proper format" since I try with no avail. I could appreciate some idea on how to do that. The functions itself is:

PE(x1,x2) = .5*K1*[sqrt(x1^2+(L1-x2)^2)]^2+.5*K2*[sqrt(x1^2+(L2+x2)^2)]^2-P1*x1-P2*x2

Where, K1, K2, P1, and P2 are constant. Thank you.

Contact us