DOI: 10.1007/bf02591693. Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization

Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization

10.1007/bf02591693

Crossref journal-article

Springer Science and Business Media LLC

Mathematical Programming (297)

Bibliography

Sen, S., & Sherali, H. D. (1987). Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization. Mathematical Programming, 37(2), 169â183.

Authors 2

S. Sen (first)
Hanif D. Sherali (additional)

References 32 Referenced 25

M. Avriel, “Methods for solving signomial and reverse convex programming problems,” in: M. Avriel, M.J. Rijckaert and D.J. Wilde, eds.,Optimization and Design (Prentice-Hall, Englewood Cliffs, NJ, 1973) pp. 307–320. / Optimization and Design by M. Avriel (1973)
M. Avriel,Nonlinear Programming: Analysis and Methods (Prentice-Hall, Englewood Cliffs, NJ, 1976). / Nonlinear Programming: Analysis and Methods by M. Avriel (1976)
M. Avriel and A.C. Williams, “Complementary geometric programming,”SIAM Journal of Applied Mathematics 19 (1970) 125–141. (10.1137/0119011) / SIAM Journal of Applied Mathematics by M. Avriel (1970)
E. Balas, “Intersection cuts—a new type of cutting planes for integer programming,”Operations Research 19 (1971) 19–39. (10.1287/opre.19.1.19) / Operations Research by E. Balas (1971)
E. Balas, “Disjunctive programming: Cutting planes from logical conditions,” in: O.L. Mangasarian, R.R. Meyer and S.M. Robinson, eds.,Nonlinear Programming (Academic Press, New York, 1975) pp. 279–312. (10.1016/B978-0-12-468650-2.50015-8) / Nonlinear Programming by E. Balas (1975)
P.P. Bansal and S.E. Jacobsen, “Characterization of local solutions for a class of nonconvex programs,”Journal of Optimization Theory and Application 15 (1975a) 549–564. (10.1007/BF00933745) / Journal of Optimization Theory and Application by P.P. Bansal (1975)
P.P. Bansal and S.E. Jacobsen, “An algorithm for optimizing network flow capacity under economies of scale,Journal of Optimization Theory and Application 15 (1975b) 565–586. (10.1007/BF00933746) / Journal of Optimization Theory and Application by P.P. Bansal (1975)
J. Bard and J.E. Falk, “An explicit solution to the multi-level programming problem”,Computers and Operations Research 9 (1982a) 77–100. (10.1016/0305-0548(82)90007-7) / Computers and Operations Research by J. Bard (1982)
J. Bard and J.E. Falk, “A separable programming approach to the linear complementarity problem,”Computers and Operations Research 9 (1982b) 153–159. (10.1016/0305-0548(82)90014-4) / Computers and Operations Research by J. Bard (1982)
R.W. Cottle and G.B. Dantzig, “Complementary pivot theory of mathematical programming,”Linear Algebra and Applications 1 (1968) 103–125. (10.1016/0024-3795(68)90052-9) / Linear Algebra and Applications by R.W. Cottle (1968)
R.S. Dembo, “Solution of complementary geometric programming problems,” M.Sc. Thesis, Technion, Israel Institute of Technology, Haifa (1972). / Solution of complementary geometric programming problems by R.S. Dembo (1972)
G. Gallo and A. Ulkucu, “Bilinear programming: An exact algorithm,”Mathematical Programming 12 (1977) 173–194. (10.1007/BF01593787) / Mathematical Programming by G. Gallo (1977)
F. Glover, “Convexity cuts and cut search,”Operations Research 21 (1973) 123–124. (10.1287/opre.21.1.123) / Operations Research by F. Glover (1973)
F. Glover, “Polyhedral convexity cuts and negative edge extensions,”Zeitschrift für Operations Research 18 (1974) 181–186. / Zeitschrift für Operations Research by F. Glover (1974)
S.A. Gustafson and K.O. Kortanek, “Numerical solution of a class of semiinfinite programming problems,”Naval Research Logistics Quarterly 20 (1973) 477–504. (10.1002/nav.3800200310) / Naval Research Logistics Quarterly by S.A. Gustafson (1973)
R.J. Hillestad, “Optimization problems subject to a budget constraint with economies of scale,”Operations Research 23 (1975) 1091–1098. (10.1287/opre.23.6.1091) / Operations Research by R.J. Hillestad (1975)
R.J. Hillestad and S.E. Jacobsen, “Reverse convex programming,”Applied Mathematics and Optimization 6 (1980a) 63–78. (10.1007/BF01442883) / Applied Mathematics and Optimization by R.J. Hillestad (1980)
R.J. Hillestad and S.E. Jacobsen, “Linear programs with an additional reverse convex constraint,”Applied Mathematics and Optimization 6 (1980b) 257–269. (10.1007/BF01442898) / Applied Mathematics and Optimization by R.J. Hillestad (1980)
R.G. Jeroslow, “Cutting planes for complementarity constraints,”SIAM Journal on Control and Optimization 16 (1978) 56–62. (10.1137/0316005) / SIAM Journal on Control and Optimization by R.G. Jeroslow (1978)
C.E. Lemke, “Bimatrix equilibrium points and mathematical programming,”Management Science 11 (1965) 681–689. (10.1287/mnsc.11.7.681) / Management Science by C.E. Lemke (1965)
M. Raghavachari, “On the zero-one integer programming problem,”Operations Research 17 (1969) 680–685. (10.1287/opre.17.4.680) / Operations Research by M. Raghavachari (1969)
B. Ramarao and C.M. Shetty, “Development of valid inequalities for disjunctive programming,”Naval Research Logistics Quarterly 31 (1984) 581–600. (10.1002/nav.3800310408) / Naval Research Logistics Quarterly by B. Ramarao (1984)
R.T. Rockafellar,Convex Analysis (Princeton University Press, Princeton, NJ, 1970). (10.1515/9781400873173) / Convex Analysis by R.T. Rockafellar (1970)
J.B. Rosen, “Iterative solution of nonlinear optimal control problems,”SIAM Journal on Control 4 (1966) 223–244. (10.1137/0304021) / SIAM Journal on Control by J.B. Rosen (1966)
S. Sen and H.D. Sherali, “On the convergence of cutting plane algorithms for a class of nonconvex mathematical programs,”Mathematical Programming 31 (1985a) 42–56. (10.1007/BF02591860) / Mathematical Programming by S. Sen (1985)
S. Sen and H.D. Sherali, “A branch and bound algorithm for extreme point mathematical programming problems,”Discrete Applied Mathematics 11 (1985b) 265–280. (10.1016/0166-218X(85)90078-2) / Discrete Applied Mathematics by S. Sen (1985)
S. Sen and H.D. Sherali, “Facet inequalties from simple disjunctions in cutting plane theory,”Mathematical Programming 34 (1986) 72–83. (10.1007/BF01582164) / Mathematical Programming by S. Sen (1986)
S. Sen and A. Whiteson, “A cone splitting algorithm for reverse convex programming,”Proceedings, IEEE Conference on Systems, Man and Cybernetics (Tucson, AZ, 1985) pp. 656–660.
H.D. Sherali and C.M. Shetty,Optimization with Disjunctive Constraints (Springer-Verlag, Berlin-Heidelberg-New York, 1980a). (10.1007/978-3-642-48794-1) / Optimization with Disjunctive Constraints by H.D. Sherali (1980)
H.D. Sherali and C.M. Shetty, “Deep cuts in disjunctive programming,”Naval Research Logistics Quarterly 27 (1980b) 453–357. (10.1002/nav.3800270310) / Naval Research Logistics Quarterly by H.D. Sherali (1980)
J. Stoer and C. Witzgall,Convexity and Optimization in Finite Dimensions I (Springer-Verlag, Berlin, 1970). (10.1007/978-3-642-46216-0) / Convexity and Optimization in Finite Dimensions I by J. Stoer (1970)
C. Van de Panne,Methods for Linear and Quadratic Programming (North-Holland, Amsterdam, 1974). / Methods for Linear and Quadratic Programming by C. Panne Van de (1974)

Dates

Type	When
Created	18 years, 5 months ago (March 29, 2007, 7:45 a.m.)
Deposited	6 years, 3 months ago (May 20, 2019, 3:37 p.m.)
Indexed	1 month ago (July 28, 2025, 5:53 p.m.)
Issued	38 years, 3 months ago (June 1, 1987)
Published	38 years, 3 months ago (June 1, 1987)
Published Print	38 years, 3 months ago (June 1, 1987)

Funders 0

None

BibTeX

@article{Sen_1987, title={Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization}, volume={37}, ISSN={1436-4646}, url={http://dx.doi.org/10.1007/bf02591693}, DOI={10.1007/bf02591693}, number={2}, journal={Mathematical Programming}, publisher={Springer Science and Business Media LLC}, author={Sen, S. and Sherali, Hanif D.}, year={1987}, month=jun, pages={169–183} }

JSON

{
  "indexed": {
    "date-parts": [
      [
        2025,
        7,
        28
      ]
    ],
    "date-time": "2025-07-28T21:53:01Z",
    "timestamp": 1753739581419
  },
  "reference-count": 32,
  "publisher": "Springer Science and Business Media LLC",
  "issue": "2",
  "license": [
    {
      "start": {
        "date-parts": [
          [
            1987,
            6,
            1
          ]
        ],
        "date-time": "1987-06-01T00:00:00Z",
        "timestamp": 549504000000
      },
      "content-version": "tdm",
      "delay-in-days": 0,
      "URL": "http://www.springer.com/tdm"
    }
  ],
  "content-domain": {
    "domain": [],
    "crossmark-restriction": false
  },
  "published-print": {
    "date-parts": [
      [
        1987,
        6
      ]
    ]
  },
  "DOI": "10.1007/bf02591693",
  "type": "journal-article",
  "created": {
    "date-parts": [
      [
        2007,
        3,
        29
      ]
    ],
    "date-time": "2007-03-29T11:45:41Z",
    "timestamp": 1175168741000
  },
  "page": "169-183",
  "source": "Crossref",
  "is-referenced-by-count": 25,
  "title": "Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization",
  "prefix": "10.1007",
  "volume": "37",
  "author": [
    {
      "given": "S.",
      "family": "Sen",
      "sequence": "first",
      "affiliation": []
    },
    {
      "given": "Hanif D.",
      "family": "Sherali",
      "sequence": "additional",
      "affiliation": []
    }
  ],
  "member": "297",
  "reference": [
    {
      "key": "BF02591693_CR1",
      "first-page": "307",
      "volume-title": "Optimization and Design",
      "author": "M. Avriel",
      "year": "1973",
      "unstructured": "M. Avriel, \u201cMethods for solving signomial and reverse convex programming problems,\u201d in: M. Avriel, M.J. Rijckaert and D.J. Wilde, eds.,Optimization and Design (Prentice-Hall, Englewood Cliffs, NJ, 1973) pp. 307\u2013320."
    },
    {
      "key": "BF02591693_CR2",
      "volume-title": "Nonlinear Programming: Analysis and Methods",
      "author": "M. Avriel",
      "year": "1976",
      "unstructured": "M. Avriel,Nonlinear Programming: Analysis and Methods (Prentice-Hall, Englewood Cliffs, NJ, 1976)."
    },
    {
      "key": "BF02591693_CR3",
      "doi-asserted-by": "crossref",
      "first-page": "125",
      "DOI": "10.1137/0119011",
      "volume": "19",
      "author": "M. Avriel",
      "year": "1970",
      "unstructured": "M. Avriel and A.C. Williams, \u201cComplementary geometric programming,\u201dSIAM Journal of Applied Mathematics 19 (1970) 125\u2013141.",
      "journal-title": "SIAM Journal of Applied Mathematics"
    },
    {
      "key": "BF02591693_CR4",
      "doi-asserted-by": "crossref",
      "first-page": "19",
      "DOI": "10.1287/opre.19.1.19",
      "volume": "19",
      "author": "E. Balas",
      "year": "1971",
      "unstructured": "E. Balas, \u201cIntersection cuts\u2014a new type of cutting planes for integer programming,\u201dOperations Research 19 (1971) 19\u201339.",
      "journal-title": "Operations Research"
    },
    {
      "key": "BF02591693_CR5",
      "doi-asserted-by": "crossref",
      "first-page": "279",
      "DOI": "10.1016/B978-0-12-468650-2.50015-8",
      "volume-title": "Nonlinear Programming",
      "author": "E. Balas",
      "year": "1975",
      "unstructured": "E. Balas, \u201cDisjunctive programming: Cutting planes from logical conditions,\u201d in: O.L. Mangasarian, R.R. Meyer and S.M. Robinson, eds.,Nonlinear Programming (Academic Press, New York, 1975) pp. 279\u2013312."
    },
    {
      "key": "BF02591693_CR6",
      "doi-asserted-by": "crossref",
      "first-page": "549",
      "DOI": "10.1007/BF00933745",
      "volume": "15",
      "author": "P.P. Bansal",
      "year": "1975",
      "unstructured": "P.P. Bansal and S.E. Jacobsen, \u201cCharacterization of local solutions for a class of nonconvex programs,\u201dJournal of Optimization Theory and Application 15 (1975a) 549\u2013564.",
      "journal-title": "Journal of Optimization Theory and Application"
    },
    {
      "key": "BF02591693_CR7",
      "doi-asserted-by": "crossref",
      "first-page": "565",
      "DOI": "10.1007/BF00933746",
      "volume": "15",
      "author": "P.P. Bansal",
      "year": "1975",
      "unstructured": "P.P. Bansal and S.E. Jacobsen, \u201cAn algorithm for optimizing network flow capacity under economies of scale,Journal of Optimization Theory and Application 15 (1975b) 565\u2013586.",
      "journal-title": "Journal of Optimization Theory and Application"
    },
    {
      "key": "BF02591693_CR8",
      "doi-asserted-by": "crossref",
      "first-page": "77",
      "DOI": "10.1016/0305-0548(82)90007-7",
      "volume": "9",
      "author": "J. Bard",
      "year": "1982",
      "unstructured": "J. Bard and J.E. Falk, \u201cAn explicit solution to the multi-level programming problem\u201d,Computers and Operations Research 9 (1982a) 77\u2013100.",
      "journal-title": "Computers and Operations Research"
    },
    {
      "key": "BF02591693_CR9",
      "doi-asserted-by": "crossref",
      "first-page": "153",
      "DOI": "10.1016/0305-0548(82)90014-4",
      "volume": "9",
      "author": "J. Bard",
      "year": "1982",
      "unstructured": "J. Bard and J.E. Falk, \u201cA separable programming approach to the linear complementarity problem,\u201dComputers and Operations Research 9 (1982b) 153\u2013159.",
      "journal-title": "Computers and Operations Research"
    },
    {
      "key": "BF02591693_CR10",
      "doi-asserted-by": "crossref",
      "first-page": "103",
      "DOI": "10.1016/0024-3795(68)90052-9",
      "volume": "1",
      "author": "R.W. Cottle",
      "year": "1968",
      "unstructured": "R.W. Cottle and G.B. Dantzig, \u201cComplementary pivot theory of mathematical programming,\u201dLinear Algebra and Applications 1 (1968) 103\u2013125.",
      "journal-title": "Linear Algebra and Applications"
    },
    {
      "key": "BF02591693_CR11",
      "volume-title": "Solution of complementary geometric programming problems",
      "author": "R.S. Dembo",
      "year": "1972",
      "unstructured": "R.S. Dembo, \u201cSolution of complementary geometric programming problems,\u201d M.Sc. Thesis, Technion, Israel Institute of Technology, Haifa (1972)."
    },
    {
      "key": "BF02591693_CR12",
      "doi-asserted-by": "crossref",
      "first-page": "173",
      "DOI": "10.1007/BF01593787",
      "volume": "12",
      "author": "G. Gallo",
      "year": "1977",
      "unstructured": "G. Gallo and A. Ulkucu, \u201cBilinear programming: An exact algorithm,\u201dMathematical Programming 12 (1977) 173\u2013194.",
      "journal-title": "Mathematical Programming"
    },
    {
      "key": "BF02591693_CR13",
      "doi-asserted-by": "crossref",
      "first-page": "123",
      "DOI": "10.1287/opre.21.1.123",
      "volume": "21",
      "author": "F. Glover",
      "year": "1973",
      "unstructured": "F. Glover, \u201cConvexity cuts and cut search,\u201dOperations Research 21 (1973) 123\u2013124.",
      "journal-title": "Operations Research"
    },
    {
      "key": "BF02591693_CR14",
      "first-page": "181",
      "volume": "18",
      "author": "F. Glover",
      "year": "1974",
      "unstructured": "F. Glover, \u201cPolyhedral convexity cuts and negative edge extensions,\u201dZeitschrift f\u00fcr Operations Research 18 (1974) 181\u2013186.",
      "journal-title": "Zeitschrift f\u00fcr Operations Research"
    },
    {
      "key": "BF02591693_CR15",
      "doi-asserted-by": "crossref",
      "first-page": "477",
      "DOI": "10.1002/nav.3800200310",
      "volume": "20",
      "author": "S.A. Gustafson",
      "year": "1973",
      "unstructured": "S.A. Gustafson and K.O. Kortanek, \u201cNumerical solution of a class of semiinfinite programming problems,\u201dNaval Research Logistics Quarterly 20 (1973) 477\u2013504.",
      "journal-title": "Naval Research Logistics Quarterly"
    },
    {
      "key": "BF02591693_CR16",
      "doi-asserted-by": "crossref",
      "first-page": "1091",
      "DOI": "10.1287/opre.23.6.1091",
      "volume": "23",
      "author": "R.J. Hillestad",
      "year": "1975",
      "unstructured": "R.J. Hillestad, \u201cOptimization problems subject to a budget constraint with economies of scale,\u201dOperations Research 23 (1975) 1091\u20131098.",
      "journal-title": "Operations Research"
    },
    {
      "key": "BF02591693_CR17",
      "doi-asserted-by": "crossref",
      "first-page": "63",
      "DOI": "10.1007/BF01442883",
      "volume": "6",
      "author": "R.J. Hillestad",
      "year": "1980",
      "unstructured": "R.J. Hillestad and S.E. Jacobsen, \u201cReverse convex programming,\u201dApplied Mathematics and Optimization 6 (1980a) 63\u201378.",
      "journal-title": "Applied Mathematics and Optimization"
    },
    {
      "key": "BF02591693_CR18",
      "doi-asserted-by": "crossref",
      "first-page": "257",
      "DOI": "10.1007/BF01442898",
      "volume": "6",
      "author": "R.J. Hillestad",
      "year": "1980",
      "unstructured": "R.J. Hillestad and S.E. Jacobsen, \u201cLinear programs with an additional reverse convex constraint,\u201dApplied Mathematics and Optimization 6 (1980b) 257\u2013269.",
      "journal-title": "Applied Mathematics and Optimization"
    },
    {
      "key": "BF02591693_CR19",
      "doi-asserted-by": "crossref",
      "first-page": "56",
      "DOI": "10.1137/0316005",
      "volume": "16",
      "author": "R.G. Jeroslow",
      "year": "1978",
      "unstructured": "R.G. Jeroslow, \u201cCutting planes for complementarity constraints,\u201dSIAM Journal on Control and Optimization 16 (1978) 56\u201362.",
      "journal-title": "SIAM Journal on Control and Optimization"
    },
    {
      "key": "BF02591693_CR20",
      "doi-asserted-by": "crossref",
      "first-page": "681",
      "DOI": "10.1287/mnsc.11.7.681",
      "volume": "11",
      "author": "C.E. Lemke",
      "year": "1965",
      "unstructured": "C.E. Lemke, \u201cBimatrix equilibrium points and mathematical programming,\u201dManagement Science 11 (1965) 681\u2013689.",
      "journal-title": "Management Science"
    },
    {
      "key": "BF02591693_CR21",
      "doi-asserted-by": "crossref",
      "first-page": "680",
      "DOI": "10.1287/opre.17.4.680",
      "volume": "17",
      "author": "M. Raghavachari",
      "year": "1969",
      "unstructured": "M. Raghavachari, \u201cOn the zero-one integer programming problem,\u201dOperations Research 17 (1969) 680\u2013685.",
      "journal-title": "Operations Research"
    },
    {
      "key": "BF02591693_CR22",
      "doi-asserted-by": "crossref",
      "first-page": "581",
      "DOI": "10.1002/nav.3800310408",
      "volume": "31",
      "author": "B. Ramarao",
      "year": "1984",
      "unstructured": "B. Ramarao and C.M. Shetty, \u201cDevelopment of valid inequalities for disjunctive programming,\u201dNaval Research Logistics Quarterly 31 (1984) 581\u2013600.",
      "journal-title": "Naval Research Logistics Quarterly"
    },
    {
      "key": "BF02591693_CR23",
      "doi-asserted-by": "crossref",
      "DOI": "10.1515/9781400873173",
      "volume-title": "Convex Analysis",
      "author": "R.T. Rockafellar",
      "year": "1970",
      "unstructured": "R.T. Rockafellar,Convex Analysis (Princeton University Press, Princeton, NJ, 1970)."
    },
    {
      "key": "BF02591693_CR24",
      "doi-asserted-by": "crossref",
      "first-page": "223",
      "DOI": "10.1137/0304021",
      "volume": "4",
      "author": "J.B. Rosen",
      "year": "1966",
      "unstructured": "J.B. Rosen, \u201cIterative solution of nonlinear optimal control problems,\u201dSIAM Journal on Control 4 (1966) 223\u2013244.",
      "journal-title": "SIAM Journal on Control"
    },
    {
      "key": "BF02591693_CR25",
      "doi-asserted-by": "crossref",
      "first-page": "42",
      "DOI": "10.1007/BF02591860",
      "volume": "31",
      "author": "S. Sen",
      "year": "1985",
      "unstructured": "S. Sen and H.D. Sherali, \u201cOn the convergence of cutting plane algorithms for a class of nonconvex mathematical programs,\u201dMathematical Programming 31 (1985a) 42\u201356.",
      "journal-title": "Mathematical Programming"
    },
    {
      "key": "BF02591693_CR26",
      "doi-asserted-by": "crossref",
      "first-page": "265",
      "DOI": "10.1016/0166-218X(85)90078-2",
      "volume": "11",
      "author": "S. Sen",
      "year": "1985",
      "unstructured": "S. Sen and H.D. Sherali, \u201cA branch and bound algorithm for extreme point mathematical programming problems,\u201dDiscrete Applied Mathematics 11 (1985b) 265\u2013280.",
      "journal-title": "Discrete Applied Mathematics"
    },
    {
      "key": "BF02591693_CR27",
      "doi-asserted-by": "crossref",
      "first-page": "72",
      "DOI": "10.1007/BF01582164",
      "volume": "34",
      "author": "S. Sen",
      "year": "1986",
      "unstructured": "S. Sen and H.D. Sherali, \u201cFacet inequalties from simple disjunctions in cutting plane theory,\u201dMathematical Programming 34 (1986) 72\u201383.",
      "journal-title": "Mathematical Programming"
    },
    {
      "key": "BF02591693_CR28",
      "unstructured": "S. Sen and A. Whiteson, \u201cA cone splitting algorithm for reverse convex programming,\u201dProceedings, IEEE Conference on Systems, Man and Cybernetics (Tucson, AZ, 1985) pp. 656\u2013660."
    },
    {
      "key": "BF02591693_CR29",
      "doi-asserted-by": "crossref",
      "DOI": "10.1007/978-3-642-48794-1",
      "volume-title": "Optimization with Disjunctive Constraints",
      "author": "H.D. Sherali",
      "year": "1980",
      "unstructured": "H.D. Sherali and C.M. Shetty,Optimization with Disjunctive Constraints (Springer-Verlag, Berlin-Heidelberg-New York, 1980a)."
    },
    {
      "key": "BF02591693_CR30",
      "doi-asserted-by": "crossref",
      "first-page": "453",
      "DOI": "10.1002/nav.3800270310",
      "volume": "27",
      "author": "H.D. Sherali",
      "year": "1980",
      "unstructured": "H.D. Sherali and C.M. Shetty, \u201cDeep cuts in disjunctive programming,\u201dNaval Research Logistics Quarterly 27 (1980b) 453\u2013357.",
      "journal-title": "Naval Research Logistics Quarterly"
    },
    {
      "key": "BF02591693_CR31",
      "doi-asserted-by": "crossref",
      "DOI": "10.1007/978-3-642-46216-0",
      "volume-title": "Convexity and Optimization in Finite Dimensions I",
      "author": "J. Stoer",
      "year": "1970",
      "unstructured": "J. Stoer and C. Witzgall,Convexity and Optimization in Finite Dimensions I (Springer-Verlag, Berlin, 1970)."
    },
    {
      "key": "BF02591693_CR32",
      "volume-title": "Methods for Linear and Quadratic Programming",
      "author": "C. Panne Van de",
      "year": "1974",
      "unstructured": "C. Van de Panne,Methods for Linear and Quadratic Programming (North-Holland, Amsterdam, 1974)."
    }
  ],
  "container-title": "Mathematical Programming",
  "original-title": [],
  "language": "en",
  "link": [
    {
      "URL": "http://link.springer.com/content/pdf/10.1007/BF02591693.pdf",
      "content-type": "application/pdf",
      "content-version": "vor",
      "intended-application": "text-mining"
    },
    {
      "URL": "http://link.springer.com/article/10.1007/BF02591693/fulltext.html",
      "content-type": "text/html",
      "content-version": "vor",
      "intended-application": "text-mining"
    },
    {
      "URL": "http://link.springer.com/content/pdf/10.1007/BF02591693",
      "content-type": "unspecified",
      "content-version": "vor",
      "intended-application": "similarity-checking"
    }
  ],
  "deposited": {
    "date-parts": [
      [
        2019,
        5,
        20
      ]
    ],
    "date-time": "2019-05-20T19:37:48Z",
    "timestamp": 1558381068000
  },
  "score": 1,
  "resource": {
    "primary": {
      "URL": "http://link.springer.com/10.1007/BF02591693"
    }
  },
  "subtitle": [],
  "short-title": [],
  "issued": {
    "date-parts": [
      [
        1987,
        6
      ]
    ]
  },
  "references-count": 32,
  "journal-issue": {
    "issue": "2",
    "published-print": {
      "date-parts": [
        [
          1987,
          6
        ]
      ]
    }
  },
  "alternative-id": [
    "BF02591693"
  ],
  "URL": "http://dx.doi.org/10.1007/BF02591693",
  "relation": {},
  "ISSN": [
    "0025-5610",
    "1436-4646"
  ],
  "subject": [],
  "container-title-short": "Mathematical Programming",
  "published": {
    "date-parts": [
      [
        1987,
        6
      ]
    ]
  }
}