Home > > > Interior Point Polynomial Algorithms in Convex Programming

Interior Point Polynomial Algorithms in Convex Programming

0 stars by 0 votes
Google Book Preview of Interior Point Polynomial Algorithms in Convex Programming
Write a Review

Best Price: Rs. - Rs. Compare prices from sellers »

Book Details

Contributors
Author Arkadii Nemirovskii Yurii Nesterov
Dimensions
Height 1.02 inch
Weight 862 g
Format
Binding Paperback
Overview
Number of Pages 415 Pages
Series Name Studies in Applied and Numerical Mathematics
Publisher Society For Industrial And Applied Mathematics
Publication Year 1987
ISBN-13 9780898715156
ISBN-10 898715156
Language English
Store Locator
Bookss Local Stores

Interior Point Polynomial Algorithms in Convex Programming Price in India

Local stores for Books

or Find Shops Near Me
Shop NameAddressDistancePhone NumberMap & Direction
Does your store sale this book?
ADD YOUR STORE

Google Preview

Price Alert