Mathematical Programming for Operations Researchers and Computer Scientists
Regular price
€328.60
14 days return policy
Shipping & Delivery
A01=Albert G. Holzman
A01=Holzman
advanced optimization theory
Author_Albert G. Holzman
Author_Holzman
Basic Feasible Solution
Category=PBW
computational optimization algorithms
Cutting Plane Method
discrete optimization
Dual Objective Function
Dual Variables
Efficient Extreme Points
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
Fixed Point
Fixed Point Computing Methods
Game theory
Geometric Programming
Geometric Programming Problem
Goal Programming Model
Implicit Enumeration Method
Integer Problem
Karush Kuhn Tucker Point
Kuhn Tucker Conditions
Linear Complementarity Problem
Linear Programming
LP Problem
mathematical modeling techniques
Modified Simplex Method
multicriteria analysis
Nonbasic Variable
Nonlinear Complementarity Problem
Nonlinear Programming
nonlinear programming applications
operations research methods
Optimum Integer Solution
Pivot Column
Player II
Primal Simplex Method
Pure Strategies
Quadratic Programming
Simplex Method
Utility Independent
Product details
- ISBN 9780824714994
- Weight: 861g
- Dimensions: 178 x 254mm
- Publication Date: 01 Jun 1981
- Publisher: Taylor & Francis Inc
- Publication City/Country: US
- Product Form: Hardback
Secure
checkout
Fast Shipping
Easy returns
This book covers the fundamentals of linear programming, extension of linear programming to discrete optimization methods, multi-objective functions, quadratic programming, geometric programming, and classical calculus methods for solving nonlinear programming problems.
