Introduction to Operations Research, Volume 1CD-ROM contains: Student version of MPL Modeling System and its solver CPLEX -- MPL tutorial -- Examples from the text modeled in MPL -- Examples from the text modeled in LINGO/LINDO -- Tutorial software -- Excel add-ins: TreePlan, SensIt, RiskSim, and Premium Solver -- Excel spreadsheet formulations and templates. |
From inside the book
Results 1-3 of 82
Page xxiv
3.6 describes and illustrates how to use Excel and its Solver to formulate and solve linear programming models on a spreadsheet . ... These files also illustrate how MPL and CPLEX can be integrated with spreadsheets .
3.6 describes and illustrates how to use Excel and its Solver to formulate and solve linear programming models on a spreadsheet . ... These files also illustrate how MPL and CPLEX can be integrated with spreadsheets .
Page 87
The last use above illustrates that this function can be placed on the left of an assignment statement to place solution results into the spreadsheet ... Let us illustrate the ODBC connection for our little product - mix example .
The last use above illustrates that this function can be placed on the left of an assignment statement to place solution results into the spreadsheet ... Let us illustrate the ODBC connection for our little product - mix example .
Page 684
To illustrate this notation , consider the following example of a quadratic programming problem . Maximize f ( x1 , x2 ) = 15x1 + 30x2 + 4x1x2 – 2xí – 4xž , subject to = x1 + 2x2 = 30 and x = 0 , x2 > 0 .
To illustrate this notation , consider the following example of a quadratic programming problem . Maximize f ( x1 , x2 ) = 15x1 + 30x2 + 4x1x2 – 2xí – 4xž , subject to = x1 + 2x2 = 30 and x = 0 , x2 > 0 .
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
Introduction to Operations Research Frederick S. Hillier,Gerald J. Lieberman No preview available - 2001 |
Common terms and phrases
activity algebraic algorithm allocation allowable range artificial variables assignment problem augmenting path basic solution Big M method changes coefficients column Consider the following constraint boundary corresponding CPLEX decision variables dual problem dynamic programming entering basic variable example feasible region feasible solutions final simplex tableau final tableau following problem formulation functional constraints Gaussian elimination given goal goal programming graphically identify increase initial BF solution integer interior-point iteration leaving basic variable linear programming model linear programming problem LP relaxation lution Maximize Maximize Z maximum flow problem Minimize needed node nonbasic variables objective function obtained optimal solution optimality test path Plant presented in Sec primal problem Prob procedure range to stay resource right-hand sides sensitivity analysis shadow prices slack variables solve this model Solver spreadsheet step subproblem surplus variables tion transportation problem transportation simplex method weeks Wyndor Glass x₁ zero