| R. Bronson / &
G. Naadimuthu
(bibl.), “Operations Research" |
* Linear Programming
(RB: Richard Bronson, 1982;
RBGN: Bronson & Naadimuthu, 2001)
• Book LP_Bronson.Pdf ptx
(3 Mb, RB, 22 pp): Chap. 1 ptx, Chap. 4 soln (4.19 → 2.13)
Bronson.2.13.xlsx
• Aztec refinery:
(a) |AztecRBGN.Pdf or
AztecRB.Pdf| ptx (prb1.7: RB or RBGN, 3 pp);
(b) AztecExplained.pdf;
(c) AztecExcel.xslx & AztecExcel.pdf;
(d) Aztec.txt for CWS;
(e) AztecCWS1.pdf,
c3 = 6+ → AztecCWS2.pdf, Azte.lp;
(f) AztecDual.xlsx
• Chap. 1: prb1.1.xlsx w. graph;
prb1.3.xlsx
(Suggested: 1.16–19, 1.22)
• Typical cases: refinery
prb1.7.xls,
.ltx;
diet, artificial variables, matrix technique
prb1.17.xls (→4.21),
.ltx,
matrix Zionts.xls prb.
• Chap. 4: prb4 LP_Bronson.04.xlsx (4.1–4, 6)
(4.3 tableaux.xls, unbounded);
juice prb4.23←1.19:
.LP_juice.xlsx (Solver options),
.ltx
• BN prb5.* BronsonNaad5.txt.txt
Lindo style 'prb': problem; 'ptx': problem text ?
(enunciado) |
| J. E. Beasley |
* Linear Programming
• Beasley
LP_BeasSoln.pdf (QSB related, 15 pp)
(assembly, polish, pack: LP_BeasSmall.xlsx).
Two Mines; LP_BeasSoln.xls.
QSB: sensitivity.pdf,
soln.xls.
• Lindo (assembly, etc.) prb. PrPlan.ltx &
soln.pdf
• IP, BIP • Prb_1 "Blending"
Problem1_Blend.pdf, animal feed
(4 pp, solved),
Probl1a.ltx;
Probl1b.ltx
Probl1b.lp (w/ binaries);
Probl1.xlsx
• Prb_2 Tricks: Problem2_MonthProd_tricks.pdf monthly production
(search trick)
• (Prb_3 Toy manufacturing:
Problem3_1996_ToyManuf.pdf,
Probl3.xls,
.ltx,
.LPP)
• Prb_4 Problem4_1995_Invest.pdf
• Prb_5 Oils: Problem5_1994_Oils.pdf,
Probl5.ltx,
.LPP
• (Prb_6 1985 exam: Problem6_1985_Factory4prod.pdf
• Prb_7 1987 exam: Problem7_1987_Mix7.pdf) |
| H. P. Williams
(bibl.),
“Model building in mathematical programming” (models) |
* Linear Programming
• (2ed 1985) (Preface) Also
a number of mistakes....Pdf (page x) (6.3 Mb, 4 pp)
Eiselt & S.: about H. P. Williams.Pdf
• |Prb 6 Refinery optimization.Pdf|
(3 Mb 4ed pp 236–243 272–275 314–315):
pp stat=236, form=272, soln=314,
HPW_refinery.xlsx
Prb 7 Mining 238-275-314; Prb 8 Farm planning 239-0-315;
Prb 9 Economic planning 240-0-0; Prb 10 Decentralization 242-0-0.
• Prb 19 |Distribution 1.Pdf|
(5.0 Mb 4ed pp 248–253, 294–297, 324–329):
pp 249-295-325, HPWilliams_Distrib1.xlsx,
.ltx
Versions of Apr-2017:
HPWilliams19.xlsx (Excel),
HPWilliams19.ltx (Lindo),
HPWilliams19.lp
(NEOS CPLEX)
• Selected problem list.pdf
(4ed, complete only: Prb 19 p 249 Distribution 1, Prb 20 p 251 Distribution 2)
• Selected |problems.Pdf|:
Prb 17 Noughts & crosses 248-0-324,
Prb 18 Optimizing a constraint 249-0-324,
Prb 19 Distrib. 1 249-295-325,
Prb 20 Distrib. 2 251-297-327, Prb 21 Agric. pricing 252-0-328,
Prb 22 Efficiency analysis 293-0-329. |
| Eiselt & Sandblom |
• G: MILP (Mixed Integer Linear Programming)
• TSP,
travelling salesman problem
• optimum (n./adj.),
greatest degree / best,
most advantageous
|
| Bibliography
H&L [Hillier & Lieberman, 2005]; BronNaad [Bronson &
Naadimuthu, 1997]; EckerKup [Ecker & Kupferschmid, 1988];
Sultan [Sultan, 1993]
• NIST/SEMATECH e-Handbook of
Statistical Methods |
