Worst case analysis of resistive networks using linear programming approach (Q1052993): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A theorem on inverses of convex sets of real matrices with application to the worst case dc problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4132373 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4126046 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4039868 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 08:48, 14 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Worst case analysis of resistive networks using linear programming approach |
scientific article |
Statements
Worst case analysis of resistive networks using linear programming approach (English)
0 references
1983
0 references
DC networks
0 references
worst case DC problem
0 references
linear programming problem
0 references
gradient of network functions
0 references
0 references
