A01=Melvyn Jeter
advanced mathematical programming techniques
Author_Melvyn Jeter
Basic Feasible Solution
Category=PBW
complementarity
computational methods
convex analysis
Convex Function
Convex Polytope
Convex Subset
dual
duality principles
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
feasible
Finite Optimal Solution
graduate mathematics
Kuhn Tucker Conditions
linear
Linear Complementarity Problem
Linear Programming Problem
Mathematical Programming Problem
Maximal Flow Problem
Melvyn W. Jeter
Minimal Cost Network Flow Problem
Network Flow Problem
Node Arc Incidence Matrix
optimization theory
Penalty Function Method
Powell's Algorithm
Powell’s Algorithm
primal
Primal Dual Algorithm
Primal Simplex Method
problem
problems
procedure
Pseudoconvex Function
Quasiconvex Function
Relative Maximum
Relative Minimum
Revised Simplex Method
Shortests Paths
simplex
Simplex Procedure
Simplex Tableau
solution
unconstrained optimization
Product details
- ISBN 9780824774783
- Weight: 830g
- Dimensions: 152 x 229mm
- Publication Date: 01 May 1986
- Publisher: Taylor & Francis Inc
- Publication City/Country: US
- Product Form: Hardback
Secure
checkout
Fast Shipping
Easy returns
This book serves as an introductory text in mathematical programming and optimization for students having a mathematical background that includes one semester of linear algebra and a complete calculus sequence. It includes computational examples to aid students develop computational skills.
Jeter\, Melvyn
