Name: Geometric Programming for Design Equation Development and Cost/Profit Optimization (with illustrative case study problems and solutions), Third Edition (en Inglés)
Price: 65310.00 CLP
Availability: InStock
Author: Robert C. Creese
ISBN: 9783031793776

portada Geometric Programming for Design Equation Development and Cost/Profit Optimization (with illustrative case study problems and solutions), Third Edition (en Inglés)

Geometric Programming for Design Equation Development and Cost/Profit Optimization (with illustrative case study problems and solutions), Third Edition (en Inglés)

Formato

Libro Físico

Editorial

Springer Nature B.V.

Autor

Robert C. Creese

Año

2016

Idioma

Inglés

N° páginas

212

Encuadernación

Tapa Blanda

Dimensiones

23.5 x 19.1 cm

ISBN13

9783031793776

Geometric Programming for Design Equation Development and Cost/Profit Optimization (with illustrative case study problems and solutions), Third Edition (en Inglés)

Robert C. Creese (Autor) · Springer Nature B.V. · Tapa Blanda

Libro Nuevo Importado

Envío: 12 a 16 días háb.

$ 130.610$ 65.310

-50%

Costos de importación incluídos en el precio ✅

Libro Nuevo

Quedan 50 unidades

$ 65.310

Llega entre el 24 Ago y el 28 Ago a Santiago, Región Metropolitana. Seleccionar ubicación

Agregar a lista de deseos

Reseña del libro "Geometric Programming for Design Equation Development and Cost/Profit Optimization (with illustrative case study problems and solutions), Third Edition (en Inglés)"

Geometric Programming is used for cost minimization, profit maximization, obtaining cost ratios, and the development of generalized design equations for the primal variables. The early pioneers of geometric programming-Zener, Duffin, Peterson, Beightler, Wilde, and Phillips-played important roles in its development. Five new case studies have been added to the third edition. There are five major sections: (1) Introduction, History and Theoretical Fundamentals; (2) Cost Minimization Applications with Zero Degrees of Difficulty; (3) Profit Maximization Applications with Zero Degrees of Difficulty; (4) Applications with Positive Degrees of Difficulty; and (5) Summary, Future Directions, and Geometric Programming Theses & Dissertations Titles. The various solution techniques presented are the constrained derivative approach, condensation of terms approach, dimensional analysis approach, and transformed dual approach. A primary goal of this work is to have readers develop more case studies and new solution techniques to further the application of geometric programming.