Solution of and bounding in a linearly constrained optimization problem with convex, polyhedral objective function (Q1904656): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: New Finite Pivoting Rules for the Simplex Method / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3288565 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5336851 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computational experience with a primal-dual interior point method for linear programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Dual method for the solution of a one-stage stochastic programming problem with random RHS obeying a discrete probability distribution / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5439479 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Decomposing the requirement space of a transporation problem into polyhedral cones / rank | |||
Normal rank | |||
Latest revision as of 08:01, 24 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solution of and bounding in a linearly constrained optimization problem with convex, polyhedral objective function |
scientific article |
Statements
Solution of and bounding in a linearly constrained optimization problem with convex, polyhedral objective function (English)
0 references
24 July 1996
0 references
polyhedral functions
0 references
simplicial functions
0 references
linearly constrained optimization
0 references
fast bounding technique
0 references
0 references
