GIPALS - Linear Programming Environment 3.3
constrained optimization problems arising in various industrial, financial and educational areas. Constrained optimization problems are stated as linear programs with UNLIMITED number of decision variables and constraints. The linear program solver is based on Interior-Point method (Mehrotra predictor-corrector algorithm) and optimized for large sparse linear programs by implementing the state-of-art algorithm to order the constraints matrix. The |

EazyDoc 2.0

EazyDoc documents the structure of MS-SQL 2000 & 2005 databases. The final product is an easy-to-read Word document that can include: Primary Keys, Field Information (type, size, identity, nullable, description), Indexes, Check Constraints, Rule Constraints, Default Constraints, Foreign Key Constraints, Triggers, Stored Procedures, Views, User Defined Data Types, User Defined Functions, Defaults and Rules.

database structure, sql tools, database documention, sql server, primary keys, database documenter, data, eazydoc, schema, ms sql, database annotations, database, default constraint

WebCab Optimization (J2SE Edition) 2.6

constrained local multidimensional optimization; unconstrained global multidimensional optimization; constrained optimization for derivable functions with linear constraints; linear programming - here the functions are linear and the constraints are linear; sensitivity Analysis - Stability of the value and location of the extremum This product also contains the following feature: GUI Bundle - we bundle a suite of graphical user interface JavaBean

optimization, minima, java, class libraries, local global, maxima, linear programming, javabeans, j2se

WebCab Optimization (J2EE Edition) 2.6

constrained local multidimensional optimization; unconstrained global multidimensional optimization; constrained optimization for derivable functions with linear constraints; linear programming - here the functions are linear and the constraints are linear; sensitivity Analysis - Stability of the value and location of the extremum This product also contains the following feature: GUI Bundle - we bundle a suite of graphical user interface JavaBean

combination, minimum, maximum, optimization, websphere, dimensional, local, local global, problem algorithm, j2ee, global, java, minima

GIPALS32 - Linear Programming Library 3.0

constraints and variables is unlimited. The linear program solver is based on Interior-Point method (Mehrotra predictor-corrector algorithm) and optimized for large sparse linear programs by implementing the state-of-art algorithm to order the constraints matrix. The user can specify the linear program using a set of exported DLL functions. Also GIPALS32 provides an import of linear programs from Mathematical Programming System (MPS) data format

optimization, linear programming library, linear program, library, matrix, gipals32, primal dual, linear programming, interior point, constrained optimization, constraint

WebCab Portfolio for .NET 4.2

.NET, COM and XML Web service implementation of Markowitz Theory and Capital Asset Pricing Model (CAPM) to analyze and construct the optimal portfolio with/without asset weight constraints. Also includes Performance Evaluation, interpolation procedures, analysis of Efficient Frontier, Market Portfolio and CML.

efficient frontier, markowitz theory, market portfolio, optimal portfolio, capm, component, vb net, pricing model, capital asset, performance interpolation

WebCab Portfolio for Delphi 4.2

3-in-1: Delphi, COM and XML Web service implementation of Markowitz Theory and Capital Asset Pricing Model (CAPM) to analyze and construct the optimal portfolio with/without asset weight constraints. Also includes Performance Evaluation, interpolation procedures, analysis of Efficient Frontier, Market Portfolio and CML.

performance measures, portfolio theory, efficient frontier, capm, markowitz, win32, risk return, vb net, indifference curves, delphi