Home
»
Conical Approach to Linear Programming
Conical Approach to Linear Programming
Regular price
€353.40
603 verified reviews
100% verified
In stock with our UK publisher. 14-28 days
Delivery/Collection within 10-20 working days
Shipping & Delivery
Our Delivery Time Frames Explained
2-4 Working Days: Available in-stock
14-28 Working Days: On Backorder
Will Deliver When Available: On Pre-Order or Reprinting
We ship your order once all items have arrived at our warehouse and are processed. Need those 2-4 day shipping items sooner? Just place a separate order for them!
Close
A01=P D'Alessandro
advanced linear programming techniques
Author_P D'Alessandro
Category=PBU
Category=UM
Category=UYA
Conical optimality conditions
Convex cones
Dual conical algorithms
eq_bestseller
eq_computing
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
eq_non-fiction
Essential background
Euclidean spaces
General Theory
Linear optimization problems
mathematical optimisation
numerical algorithm implementation
polyhedral theory
primal dual methods
robust decision analysis
vector optimisation
Product details
- ISBN 9789056990312
- Weight: 754g
- Dimensions: 152 x 229mm
- Publication Date: 29 Oct 1997
- Publisher: Taylor & Francis Ltd
- Publication City/Country: GB
- Product Form: Hardback
The conical approach provides a geometrical understanding of optimization and is a powerful research tool and useful problem-solving technique (for example, in decision support and real time control applications).
Conical optimality conditions are first stated in a very general optimization framework, and then applied to linear programming. A complete theory along with primal and dual algorithms is given, and solutions and algorithms are also provided for vector and robust linear optimization. The advantages of parameter dependence of conical methods are fully discussed. In addition to numerical results, the book provides source codes and detailed documentation of a Modula-2 implementation for the main algorithms.
Conical Approach to Linear Programming
€353.40
