Linear and Nonlinear Programming
Av David G. Luenberger, Yinyu Ye, 2010.Del av serien International Series in Operations Research & Management Science.
Linear Programming.- Basic Properties of Linear Programs.- The Simplex Method.- Duality.- Interior-Point Methods.- Transportation and Network Flow Problems.- Unconstrained Problems.- Basic Properties of Solutions and Algorithms.- Basic Descent Methods.- Conjugate Direction Methods.- Quasi-Newton Methods.- Constrained Minimization.- Constrained Minimization Conditions.- Primal Methods.- Penalty and Barrier Methods.- Dual and Cutting Plane Methods.- Primal-Dual Methods.
Språk: Engelsk
Linear and Nonlinear Programming
Av David G. Luenberger, Yinyu Ye, 2010.Del av serien International Series in Operations Research & Management Science.
Linear Programming.- Basic Properties of Linear Programs.- The Simplex Method.- Duality.- Interior-Point Methods.- Transportation and Network Flow Problems.- Unconstrained Problems.- Basic Properties of Solutions and Algorithms.- Basic Descent Methods.- Conjugate Direction Methods.- Quasi-Newton Methods.- Constrained Minimization.- Constrained Minimization Conditions.- Primal Methods.- Penalty and Barrier Methods.- Dual and Cutting Plane Methods.- Primal-Dual Methods.
Språk: Engelsk
Ved å fullføre kjøpet aksepterer du kjøpsvilkårene.
