Scribd
Upload
20 views5 pages

Linear Programming Model Sum or

Uploaded by

Sathwik Mahendra
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
20 views5 pages

Linear Programming Model Sum or

Uploaded by

Sathwik Mahendra
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
You are on page 1/ 5

Microsoft Excel 16.

0 Answer Report
Worksheet: [Book1]Sheet1
Report Created: 08-11-2024 11:57:14
Result: Solver found a solution. All Constraints and optimality conditions are satisfied.
Solver Engine
Engine: GRG Nonlinear
Solution Time: 0.063 Seconds.
Iterations: 4 Subproblems: 0
Solver Options
Max Time Unlimited, Iterations Unlimited, Precision 0.000001, Use Automatic Scaling
Convergence 0.0001, Population Size 100, Random Seed 0, Derivatives Central
Max Subproblems Unlimited, Max Integer Sols Unlimited, Integer Tolerance 1%, Assume NonNegati

Objective Cell (Max)


Cell Name Original Value Final Value
$F$3 basic solution objective 0 176

Variable Cells
Cell Name Original Value Final Value Integer
$B$3 basic solution x1 0 8 Contin
$C$3 basic solution x2 0 16 Contin
$D$3 basic solution x3 0 0 Contin

Constraints
Cell Name Cell Value Formula Status Slack
$F$10 constraint 5 objective 40 $F$10<=$G$10 Not Binding 3
$F$6 constraint 1 objective 320 $F$6<=$G$6 Binding 0
$F$7 constraint 2 objective 400 $F$7<=$G$7 Binding 0
$F$8 constraint 3 objective 24 $F$8<=$G$8 Not Binding 36
$F$9 constraint 4 objective 32 $F$9<=$G$9 Not Binding 8
tions are satisfied.

tic Scaling

1%, Assume NonNegative

not binding means x3 is not binding


DV x1 x2 x3
profit 10 6 8 objective
basic solution 8 16 0 176

required max availability


constraint 1
(pears) 20 10 16 pears 320 320
constraint 2
(peaches) 10 20 16 peaches 400 400
constraint 3
(canning) 1 1 1 canning 24 60 these three c3 4 5 are
constraint 4
(packaging) 2 1 1 packaging 32 40
constraint 5
(packaging) 1 2 2 mixing 40 43
formulation of objective function and contsraint these two fetches marks in exam as said by sir
interpret output

hese three c3 4 5 are extra


ks in exam as said by sir

You might also like